Book contents
- Frontmatter
- Contents
- Preface
- I Preliminaries
- II Spanners Based on Simplicial Cones
- 4 Spanners Based on the Θ-Graph
- 5 Cones in Higher Dimensional Space and Θ-Graphs
- 6 Geometric Analysis: The Gap Property
- 7 The Gap-Greedy Algorithm
- 8 Enumerating Distances Using Spanners of Bounded Degree
- III The Well-Separated Pair Decomposition and Its Applications
- IV The Path-Greedy Algorithm and Its Analysis
- V Further Results on Spanners and Applications
- Bibliography
- Algorithms Index
- Index
7 - The Gap-Greedy Algorithm
from II - Spanners Based on Simplicial Cones
Published online by Cambridge University Press: 05 September 2009
- Frontmatter
- Contents
- Preface
- I Preliminaries
- II Spanners Based on Simplicial Cones
- 4 Spanners Based on the Θ-Graph
- 5 Cones in Higher Dimensional Space and Θ-Graphs
- 6 Geometric Analysis: The Gap Property
- 7 The Gap-Greedy Algorithm
- 8 Enumerating Distances Using Spanners of Bounded Degree
- III The Well-Separated Pair Decomposition and Its Applications
- IV The Path-Greedy Algorithm and Its Analysis
- V Further Results on Spanners and Applications
- Bibliography
- Algorithms Index
- Index
Summary
- Type
- Chapter
- Information
- Geometric Spanner Networks , pp. 120 - 138Publisher: Cambridge University PressPrint publication year: 2007