Book contents
- Frontmatter
- Contents
- Preface
- I Preliminaries
- II Spanners Based on Simplicial Cones
- III The Well-Separated Pair Decomposition and Its Applications
- IV The Path-Greedy Algorithm and Its Analysis
- V Further Results on Spanners and Applications
- 16 The Distance Range Hierarchy
- 17 Approximating Shortest Paths in Spanners
- 18 Fault-Tolerant Spanners
- 19 Designing Approximation Algorithms with Spanners
- 20 Further Results and Open Problems
- Bibliography
- Algorithms Index
- Index
17 - Approximating Shortest Paths in Spanners
from V - Further Results on Spanners and Applications
Published online by Cambridge University Press: 05 September 2009
- Frontmatter
- Contents
- Preface
- I Preliminaries
- II Spanners Based on Simplicial Cones
- III The Well-Separated Pair Decomposition and Its Applications
- IV The Path-Greedy Algorithm and Its Analysis
- V Further Results on Spanners and Applications
- 16 The Distance Range Hierarchy
- 17 Approximating Shortest Paths in Spanners
- 18 Fault-Tolerant Spanners
- 19 Designing Approximation Algorithms with Spanners
- 20 Further Results and Open Problems
- Bibliography
- Algorithms Index
- Index
Summary
![Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'](https://static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Abook%3A9780511546884/resource/name/firstPage-9780511546884c17_p415-426_CBO.jpg)
- Type
- Chapter
- Information
- Geometric Spanner Networks , pp. 415 - 426Publisher: Cambridge University PressPrint publication year: 2007