Improved algorithms for fully dynamic geometric spanners and geometric routing

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 591-600

  Gottlieb, Lee Ad ^a   Roditty, Liam ^b  

^a NEW YORK UNIVERSITY   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPACT ROUTING; EUCLIDEAN DISTANCE (ED); FUNDAMENTAL PROBLEMS; MAXIMUM (WEIGHTED) DEGREE; NEW CONSTRUCTION; NEW RESULTS; POSITION BASED (GEOMETRIC) ROUTING; TOTAL LENGTH;

ALGORITHMS; ALUMINUM; DYNAMIC ROUTING ALGORITHMS; LABELS; NETWORK ROUTING; ROUTING PROTOCOLS; SET THEORY;

ROUTING ALGORITHMS;

EID: 57449093685     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. th International Conference on Distributed Computing Systems (ICDCS). IEEE Computer Society Press, 2006.
2. S. Arya, D. M. Mount, and M. Smid. Dynamic algorithms for geometric spanners of small diameter: Randomized solutions. Computational Geometry: Theory and Applications, 13:91-107, 1999.
3. A. Bagchi, A. L. Buchsbaum, and M. T. Goodrich. Biased skip lists. Algorithmica, 42, 2005.
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. J. ACM, 42:67-90, 1995.
6. T-H. Chan, A. Gupta, B.M. Maggs, and S. Zhou. On hierarchical routing in doubling metrics. In SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms), 2005.
7. R. Cole and L. Gottlieb. Searching dynamic point sets in spaces with bounded doubling dimension. In STOC: ACM Symposium on Theory of Computing (S'TOC), 2006.
8. G. Das, G. Naraimhau, and J. Salowe. A new way to weigh malnourished Euclidean graphs. In Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 215-222, 22-24 1995.
9. J. Gao, L. Guibas, and A. Nguyen. Deformable spanners and applications. In Annual ACM Symposium on Computational Geometry, 2004.
10. S. Har-Peled and M. Mendel. Fast construction of nets in low dimensional metrics, and their applications. SIAM J. Comput, 35(5):1148-1184, 2006.
11. Y. Hassin and D. Peleg. Sparse communication networks and efficient routing in the plane. DISTCOMP: Distributed Computing, 14, 2001.
12. Goran Konjevod, Andréa W. Richa, and Donglin Xia. Optimal scale-free compact routing schemes in networks of low doubling dimension. In SODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, pages 939-948, Philadelphia, PA, USA, 2007. Society for Industrial and Applied Mathematics.
13. R. Krauthgamer and J. Lee. Navigating nets: Simple algorithms for proximity search. In Symposium on Discrete Algorithms, 2004.
14. L. Roditty. Fully dynamic geometric spanners. In To Appear in the 23rd Annual ACM Symposium on Computational Geometry, 2007.
15. J. S. Salowe. Constructing multidimensional spanner graphs. Int. J. Comput. Geometry Appl, 1(2):99-107, 1991.
16. 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.