Fast pruning of geometric spanners

Lecture Notes in Computer Science

Volumn 3404, Issue , 2005, Pages 508-520

  Gudmundsson, Joachim ^a   Narasimhan, Giri ^b   Smid, Michiel ^c  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b The Department of Electrical and Computer Engineering   (United States)

^c CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; POLYNOMIALS; QUERY LANGUAGES; SEPARATION;

AMORTIZED; GEOMETRIC SPANNER GRAPH; STRETCH FACTOR;

GRAPH THEORY;

EID: 24144457216     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31856-9_42     Document Type: Conference Paper

References (19)

1. I. Althöfer, G. Das, D. P. Dobkin, D. Joseph, and J. Soares. On sparse spanners of weighted graphs. Discrete & Computational Geometry, 9:81-100, 1993.
2. S. Arya, G. Das, D. M. Mount, J. S. Salowe, and M. Smid. Euclidean spanners: short, thin, and lanky. In Proc. 27th ACM Symposium on Theory of Computing, pages 489-498, 1995.
3. S. Arya, D. M. Mount, and M. Smid. Randomized and deterministic algorithms for geometric spanners of small diameter. In Proc. 35th IEEE Symposium on Foundations of Computer Science, pages 703-712, 1994.
4. P. Bose, J. Gudmundsson, and P. Morin. Ordered theta graphs. Computational Geometry: Theory and Applications, 28:11-18, 2004.
5. P. B. Callahan and S. R. Kosaraju. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. Journal of the ACM, 42:67-90, 1995.
6. B. Chandra, G. Das, G. Narasimhan, and J. Soares. New sparseness results on graph spanners. International Journal of Computational Geometry and Applications, 5:124-144, 1995.
7. G. Das and G. Narasimhan. A fast algorithm for constructing sparse Euclidean spanners. International Journal of Computational Geometry and Applications, 7:297-315, 1997.
8. G. Das, G. Narasimhan, and J. Salowe. A new way to weigh malnourished Euclidean graphs. In Proc. 6th ACM-SIAM Symposium on Discrete Algorithms, 1995.
9. D. Eppstein. Spanning trees and spanners. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 425-461. Elsevier Science Publishers, Amsterdam, 2000.
10. J. Gudmundsson, C. Levcopoulos, and G. Narasimhan. Improved greedy algorithms for constructing sparse geometric spanners. SIAM Journal of Computing, 31(5):1479-1500, 2002.
11. J. Gudmundsson, C. Levcopoulos, G. Narasimhan, and M. Smid. Approximate distance oracles for geometric graph. In Proc. 13th ACM-SIAM Symposium on Discrete Algorithms, pages 828-837, 2002.
12. J. Gudmundsson, C. Levcopoulos, G. Narasimhan, and M. Smid. Approximate distance oracles revisited. In Proc. 13th International Symposium on Algorithms and Computation, volume 2518 of LNCS, pages 357-368. Springer-Verlag, 2002.
13. J. Gudmundsson, C. Levcopoulos, G. Narasimhan, and M. Smid. Approximate distance oracles for geometric spanners. Technical report TR-04-08, Carleton University, School of Computer Science, 2004.
14. J. M. Keil. Approximating the complete Euclidean graph. In Proc. 1st Scandinavian Workshop on Algorithmic Theory, pages 208-213, 1988.
15. C. Levcopoulos, G. Narasimhan, and M. Smid. Improved algorithms for constructing fault-tolerant spanners. Algorithmica, 32:144-156, 2002.
16. G. Narasimhan and M. Smid. Approximating the stretch factor of Euclidean graphs. SIAM Journal on Computing, 30:978-989, 2000.
17. J. S. Salowe. Constructing multidimensional spanner graphs. International Journal of Computational Geometry & Applications, 1:99-107, 1991.
18. M. Smid. Closest point problems in computational geometry. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 877-935. Elsevier Science Publishers, Amsterdam, 2000.
19. P. M. Vaidya. A sparse graph almost as good as the complete graph on points in K dimensions. Discrete Computational Geometry, 6:369-381, 1991.