Generating low-degree 2-spanners

Guy Kortsarz, David Peleg

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

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 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.

Original languageEnglish
Title of host publicationProceedings of the Annual ACM SIAM Symposium on Discrete Algorithms
PublisherPubl by ACM
Pages556-563
Number of pages8
ISBN (Print)0898713293
StatePublished - 1994
Externally publishedYes
EventProceedings of the Fifth Annual SIAM Symposium on Discrete Algorithms - Arlington, VA, USA
Duration: 23 Jan 199425 Jan 1994

Publication series

NameProceedings of the Annual ACM SIAM Symposium on Discrete Algorithms

Conference

ConferenceProceedings of the Fifth Annual SIAM Symposium on Discrete Algorithms
CityArlington, VA, USA
Period23/01/9425/01/94

Fingerprint

Dive into the research topics of 'Generating low-degree 2-spanners'. Together they form a unique fingerprint.

Cite this