TY - GEN

T1 - Generating low-degree 2-spanners

AU - Kortsarz, Guy

AU - Peleg, David

N1 - Copyright:
Copyright 2004 Elsevier B.V., All rights reserved.

PY - 1994

Y1 - 1994

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 paper concerns the problem of finding a 2-spanner in a given graph, with minimum maximum degree. A randomized approximation algorithm is provided for this problem, with approximation ratio of O(Δ 1/4 ). We then present two probabilistic algorithms that are more efficient for sparse graphs. The algorithms are then converted into a deterministic ones, using derandomization.

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 paper concerns the problem of finding a 2-spanner in a given graph, with minimum maximum degree. A randomized approximation algorithm is provided for this problem, with approximation ratio of O(Δ 1/4 ). We then present two probabilistic algorithms that are more efficient for sparse graphs. The algorithms are then converted into a deterministic ones, using derandomization.

UR - http://www.scopus.com/inward/record.url?scp=0028199247&partnerID=8YFLogxK

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

AN - SCOPUS:0028199247

SN - 0898713293

T3 - Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms

SP - 556

EP - 563

BT - Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms

PB - Publ by ACM

T2 - Proceedings of the Fifth Annual SIAM Symposium on Discrete Algorithms

Y2 - 23 January 1994 through 25 January 1994

ER -