Generating sparse 2—Spanners

Guy Kortsarz; David Peleg

doi:10.1007/3-540-55706-7_7

Generating sparse 2—Spanners

Guy Kortsarz
, David Peleg

פרסום מחקרי: פרק בספר / בדוח / בכנס › פרסום בספר כנס › ביקורת עמיתים

תקציר

A k- spanner of a connected graph G=(V, E) is a subgraph G' consisting of all the vertices of V and a subset of the edges, with the additional property that the distance between any two vertices in G' is larger than that distance in G by no more than a factor of k. This note concerns the problem of finding the sparsest 2-spanner in a given graph, and presents an approximation algorithm for this problem with approximation ratio log(|E|/|V|).

שפה מקורית	אנגלית
כותר פרסום המארח	Algorithm Theory – SWAT 1992 - 3rd Scandinavian Workshop on Algorithm Theory, Proceedings
עורכים	Otto Nurmi, Esko Ukkonen
מוציא לאור	Springer Verlag
עמודים	73-82
מספר עמודים	10
מסת"ב (מודפס)	9783540557067
מזהי עצם דיגיטלי (DOIs)	https://doi.org/10.1007/3-540-55706-7_7
סטטוס פרסום	פורסם - 1992
פורסם באופן חיצוני	כן
אירוע	3rd Scandinavian Workshop on Algorithm Theory, SWAT 1992 - Helsinki, פינלנד משך הזמן: 8 יולי 1992 → 10 יולי 1992

סדרות פרסומים

שם	Lecture Notes in Computer Science
כרך	621 LNCS
ISSN (מודפס)	0302-9743
ISSN (אלקטרוני)	1611-3349

כנס

כנס	3rd Scandinavian Workshop on Algorithm Theory, SWAT 1992
מדינה/אזור	פינלנד
עיר	Helsinki
תקופה	8/07/92 → 10/07/92

הערה ביבליוגרפית

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1992.

גישה למסמך

10.1007/3-540-55706-7_7

קבצים וקישורים אחרים

Link to publication in Scopus

פורמט ציטוט ביבליוגרפי

@inproceedings{6d8047f9aaca42ca81093b3349690c0e,

title = "Generating sparse 2—Spanners",

abstract = "A k- spanner of a connected graph G=(V, E) is a subgraph G' consisting of all the vertices of V and a subset of the edges, with the additional property that the distance between any two vertices in G' is larger than that distance in G by no more than a factor of k. This note concerns the problem of finding the sparsest 2-spanner in a given graph, and presents an approximation algorithm for this problem with approximation ratio log(|E|/|V|).",

author = "Guy Kortsarz and David Peleg",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1992.; 3rd Scandinavian Workshop on Algorithm Theory, SWAT 1992 ; Conference date: 08-07-1992 Through 10-07-1992",

year = "1992",

doi = "10.1007/3-540-55706-7\_7",

language = "אנגלית",

isbn = "9783540557067",

series = "Lecture Notes in Computer Science",

publisher = "Springer Verlag",

pages = "73--82",

editor = "Otto Nurmi and Esko Ukkonen",

booktitle = "Algorithm Theory – SWAT 1992 - 3rd Scandinavian Workshop on Algorithm Theory, Proceedings",

address = "גרמניה",

}

Kortsarz, G & Peleg, D 1992, Generating sparse 2—Spanners. ב- O Nurmi & E Ukkonen (עורכים), Algorithm Theory – SWAT 1992 - 3rd Scandinavian Workshop on Algorithm Theory, Proceedings. Lecture Notes in Computer Science, כרך 621 LNCS, Springer Verlag, עמודים 73-82, 3rd Scandinavian Workshop on Algorithm Theory, SWAT 1992, Helsinki, פינלנד, 8/07/92. https://doi.org/10.1007/3-540-55706-7_7

Generating sparse 2—Spanners. / Kortsarz, Guy; Peleg, David.
Algorithm Theory – SWAT 1992 - 3rd Scandinavian Workshop on Algorithm Theory, Proceedings. עורך / Otto Nurmi; Esko Ukkonen. Springer Verlag, 1992. עמוד 73-82 (Lecture Notes in Computer Science; כרך 621 LNCS).

פרסום מחקרי: פרק בספר / בדוח / בכנס › פרסום בספר כנס › ביקורת עמיתים

TY - GEN

T1 - Generating sparse 2—Spanners

AU - Kortsarz, Guy

AU - Peleg, David

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1992.

PY - 1992

Y1 - 1992

N2 - A k- spanner of a connected graph G=(V, E) is a subgraph G' consisting of all the vertices of V and a subset of the edges, with the additional property that the distance between any two vertices in G' is larger than that distance in G by no more than a factor of k. This note concerns the problem of finding the sparsest 2-spanner in a given graph, and presents an approximation algorithm for this problem with approximation ratio log(|E|/|V|).

AB - A k- spanner of a connected graph G=(V, E) is a subgraph G' consisting of all the vertices of V and a subset of the edges, with the additional property that the distance between any two vertices in G' is larger than that distance in G by no more than a factor of k. This note concerns the problem of finding the sparsest 2-spanner in a given graph, and presents an approximation algorithm for this problem with approximation ratio log(|E|/|V|).

UR - https://www.scopus.com/pages/publications/85030534935

U2 - 10.1007/3-540-55706-7_7

DO - 10.1007/3-540-55706-7_7

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85030534935

SN - 9783540557067

T3 - Lecture Notes in Computer Science

SP - 73

EP - 82

BT - Algorithm Theory – SWAT 1992 - 3rd Scandinavian Workshop on Algorithm Theory, Proceedings

A2 - Nurmi, Otto

A2 - Ukkonen, Esko

PB - Springer Verlag

T2 - 3rd Scandinavian Workshop on Algorithm Theory, SWAT 1992

Y2 - 8 July 1992 through 10 July 1992

ER -

Generating sparse 2—Spanners

תקציר

סדרות פרסומים

כנס

הערה ביבליוגרפית

גישה למסמך

קבצים וקישורים אחרים

טביעת אצבע

פורמט ציטוט ביבליוגרפי