Geometric spanner networks [E-Book] / Giri Narasimhan, Michiel Smid.
Narasimhan, Giri, (author)
Smid, Michiel, (author)
Cambridge : Cambridge University Press, 2007
1 online resource (xv, 500 pages)
Full Text
Table of Contents:
  • Algorithms and graphs
  • The algebraic computation-tree model
  • Spanners based on the q-graph
  • Cones in higher dimensional space and q-graphs
  • Geometric analysis : the gap property
  • The gap-greedy algorithm
  • Enumerating distances using spanners of bounded degree
  • The well-separated pair decomposition
  • Applications of well-separated pairs
  • The dumbbell theorem
  • Shortcutting trees and spanners with low spanner diameter
  • Approximating the stretch factor of euclidean graphs
  • Geometric analysis : the leapfrog property
  • The path-greedy algorithm
  • The distance range hierarchy
  • Approximating shortest paths in spanners
  • Fault-tolerant spanners
  • Designing approximation algorithms with spanners
  • Further results and open problems.