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|).
Original language | English |
---|---|
Title of host publication | Algorithm Theory – SWAT 1992 - 3rd Scandinavian Workshop on Algorithm Theory, Proceedings |
Editors | Otto Nurmi, Esko Ukkonen |
Publisher | Springer Verlag |
Pages | 73-82 |
Number of pages | 10 |
ISBN (Print) | 9783540557067 |
DOIs | |
State | Published - 1992 |
Externally published | Yes |
Event | 3rd Scandinavian Workshop on Algorithm Theory, SWAT 1992 - Helsinki, Finland Duration: 8 Jul 1992 → 10 Jul 1992 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 621 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 3rd Scandinavian Workshop on Algorithm Theory, SWAT 1992 |
---|---|
Country/Territory | Finland |
City | Helsinki |
Period | 8/07/92 → 10/07/92 |
Bibliographical note
Publisher Copyright:© Springer-Verlag Berlin Heidelberg 1992.