Additive spanners and (α, β)-spanners
Authors:
Open Access
- 1 November 2010
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Algorithms
- Vol. 7 (1) , 1-26
Abstract
An (α, β)-spanner of an unweighted graph G is a subgraph H that distorts distances in G up to a multiplicative factor of α and an additive term β. It is well known that any graph contains a (multiplicative) (2 k −1, 0)-spanner of size O ( n 1+1/ k ) and an (additive) (1,2)-spanner of size O ( n 3/2 ). However no other additive spanners are known to exist. In this article we develop a couple of new techniques for constructing (α, β)-spanners. Our first result is an additive (1,6)-spanner of size O ( n 4/3 ). The construction algorithm can be understood as an economical agent that assigns costs and values to paths in the graph, purchasing affordable paths and ignoring expensive ones, which are intuitively well approximated by paths already purchased. We show that this path buying algorithm can be parameterized in different ways to yield other sparseness-distortion tradeoffs. Our second result addresses the problem of which (α, β)-spanners can be computed efficiently, ideally in linear time. We show that, for any k , a ( k , k −1)-spanner with size O ( kn 1+1/ k ) can be found in linear time, and, further, that in a distributed network the algorithm terminates in a constant number of rounds. Previous spanner constructions with similar performance had roughly twice the multiplicative distortion.Keywords
Funding Information
- Seventh Framework Programme (IST-1999-14186)
This publication has 48 references indexed in Scilit:
- Ramsey partitions and proximity data structuresJournal of the European Mathematical Society, 2007
- Approximate distance oracles for unweighted graphs in expected O ( n 2 ) timeACM Transactions on Algorithms, 2006
- Computing almost shortest pathsACM Transactions on Algorithms, 2005
- Approximate distance oraclesJournal of the ACM, 2005
- A tight bound on approximating arbitrary metrics by tree metricsJournal of Computer and System Sciences, 2004
- Compact roundtrip routing in directed networksJournal of Algorithms, 2004
- Compact Routing with Minimum StretchJournal of Algorithms, 2001
- Polylog-time and near-linear work approximation scheme for undirected shortest pathsJournal of the ACM, 2000
- A trade-off between space and efficiency for routing tablesJournal of the ACM, 1989
- Graph spannersJournal of Graph Theory, 1989