| Description |
xv, 500 pages : illustrations ; 27 cm |
| Contents |
1. Introduction -- 2. Algorithms and graphs -- 3. The algebraic computation-tree model -- 4. Spanners based on the [actual symbol not reproducible]-graph -- 5. Cones in higher dimensional space and [actual symbol not reproducible]-graphs -- 6. Geometric analysis : the gap property -- 7. The gap-greedy algorithm -- 8. Enumerating distances using spanners of bounded degree -- 9. The well-separated pair decomposition -- 10. Applications of well-separated pairs -- 11. The dumbbell theorem -- 12. Shortcutting trees and spanners with low spanner diameter -- 13. Approximating the stretch factor of Euclidean graphs -- 14. Geometric analysis : the leapfrog property -- 15. The path-greedy algorithm -- 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 |
| Summary |
"Aimed at an audience of researchers and graduate students in computational geometry and algorithm design, this hook uses the Geometric spanner Network Problem to showcase a number of useful algorithmic techniques, data structure strategies, and geometric analysis techniques with many applications, practical and theoretical." |
|
"The authors present rigorous descriptions of the main algorithms and their analyses for different variations of the Geometric Spanner Network Problem. Although the basic ideas behind most of these algorithms are intuitive, very few are easy to describe and analyze, tor most of the algorithms, nontrivial data structures need to be designed, and nontrivial techniques need to he developed in order for analysis to take place. Still, there are several basic principle's and results that are used throughout the book. One of the most important is the powerful well-separated pair decomposition. This decomposition is used as a starting point for several of the spanner constructions."--BOOK JACKET |
| Bibliography |
Includes bibliographical references (pages 483-494) and indexes |
| Subject |
Computer algorithms.
|
|
Geometry -- Data processing.
|
|
Trees (Graph theory) -- Data processing.
|
| Author |
Smid, Michiel.
|
| LC no. |
2006028718 |
| ISBN |
0521815134 (hbk.) |
|
9780521815130 (hbk.) |
|
