TY - JOUR
T1 - Generating sparse 2-spanners
AU - Kortsarz, Guy
AU - Peleg, David
N1 - Copyright:
Copyright 2017 Elsevier B.V., All rights reserved.
PY - 1994/9
Y1 - 1994/9
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 - http://www.scopus.com/inward/record.url?scp=0003564254&partnerID=8YFLogxK
U2 - 10.1006/jagm.1994.1032
DO - 10.1006/jagm.1994.1032
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0003564254
SN - 0196-6774
VL - 17
SP - 222
EP - 236
JO - Journal of Algorithms
JF - Journal of Algorithms
IS - 2
ER -