Generating sparse 2—Spanners

Guy Kortsarz, David Peleg

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


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

Original languageEnglish
Title of host publicationAlgorithm Theory – SWAT 1992 - 3rd Scandinavian Workshop on Algorithm Theory, Proceedings
EditorsOtto Nurmi, Esko Ukkonen
PublisherSpringer Verlag
Number of pages10
ISBN (Print)9783540557067
StatePublished - 1992
Externally publishedYes
Event3rd Scandinavian Workshop on Algorithm Theory, SWAT 1992 - Helsinki, Finland
Duration: 8 Jul 199210 Jul 1992

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume621 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference3rd Scandinavian Workshop on Algorithm Theory, SWAT 1992

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1992.


Dive into the research topics of 'Generating sparse 2—Spanners'. Together they form a unique fingerprint.

Cite this