Fast, precise and dynamic distance queries

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2011, Pages 840-853

  Bartal, Yair ^a   Gottlieb, Lee Ad ^b   Kopelowitz, Tsvi ^c   Lewenstein, Moshe ^c   Roditty, Liam ^c  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

CONSTANT TIME; DOUBLING DIMENSIONS; EXPECTED TIME; POINT SET; QUERY TIME;

QUERY PROCESSING;

EID: 79955711185     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973082.66     Document Type: Conference Paper

References (29)

1. Ittai Abraham, Yah Bartal, and Ofer Neiman. Embedding metric spaces in their intrinsic dimension. In Proc. of the Symposium on Discrete Algorithms (SODA), pages 363-372, 2008.
2. S. Alstrup and J. Holm. Improved algorithms for finding level ancestors in dynamic trees. In Proc. of the International Colloquium on Automata, Languages and Programming (ICALP), pages 73-84, 2000.
3. n. Bull. Soc. Math.., lll(4):429-448, 1983.
4. S. Baswana and T. Kavitha. Faster algorithms for approximate distance oracles and all-pairs small stretch paths. In Proc. of the Symposium on Foundations of Computer Science (FOCS), pages 591-602, 2006.
5. 2) time. ACM Transactions on Algorithms, 2(4):557-577, 2006. (Pubitemid 46174061)
6. R. Cole and L. Gottlieb. Searching dynamic point sets in spaces with bounded doubling dimension. In Proc. of ACM Symposium on Theory of Computing (STOC), pages 574-583, 2006. (Pubitemid 44306592)
7. R. Cole and R. Hariharan. Dynamic lea queries on trees. SIAM J. Comput., 34(4):894-923, 2005.
8. J. Gao, L. Guibas, and A. Nguyen. Deformable spanners and applications. In Proc. of Symposium on Computational Geometry (SOCG), pages 190-199, 2004.
9. L. Gottlieb and L. Roditty. Improved algorithms for fully dynamic geometric spanners and geometric routing. In Proc. of Symposium on Discrete Algorithms (SODA), pages 591-600, 2008.
10. L. Gottlieb and L. Roditty. An optimal dynamic spanner for doubling metric spaces. In Proc. of the Annual European Symposium on Algorithms (ESA), pages 478-489, 2008.
11. J. Gudmundsson, C. Levcopoulos, G. Narasimhan, and M. Smid. Approximate distance oracles for geometric spanners. ACM Transactions on Algorithms, 4(1), 2008.
12. A. Gupta, R. Krauthgamer, and J. Lee. Bounded geometries, fractals, and low-distortion embeddings. InProc. of the Symposium on Foundations of Computer Science (FOCS), pages 534-543, 2003.
13. 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. (Pubitemid 44599922)
14. P. Indyk, A. Magen, A. Sidiropoulos, and A. Zouzias. On-line embeddings. In Proc. of APPROX, 2010.
15. P. Klein. Preprocessing an undirected planar network to enable fast approximate distance queries. In Proc. of the Symposium on Discrete Algorithms (SODA), pages 820-827, 2002.
16. Tsvi Kopelowitz and Moshe Lewenstein. Dynamic weighted ancestors. In Proc. of the Symposium on Discrete Algorithms (SODA), pages 565-574, 2007.
17. R. Krauthgamer and J. Lee. Navigating nets: Simple algorithms for proximity search. In Proc. of the Symposium on Discrete Algorithms (SODA), pages 798-807, 2004.
18. M. Mendel and A. Naor. Ramsey partitions and proximity data structures. In Proc. of the Symposium on the Foundations of Computer Science (FOCS), pages 109-118, 2006. (Pubitemid 351175501)
19. M. Mendel and C. Schwob. Fast c-k-r partitions of sparse graphs. Chicago Journal of Theoretical Computer Science, 2009(2), 2009.
20. R. A. Moser and G. Tardos. A constructive proof of the general lovász local lemma. Journal of the ACM, 57(2):1-15, 2010.
21. M. Pǎtraşcu. Unifying the landscape of cell-probe lower bounds. In Proc. of the Symposium on Foundations of Computer Science (FOCS), pages 434-443, 2008.
22. L. Roditty. Fully dynamic geometric spanners. In Proc. of Symposium on Computational Geometry (SOCG), pages 373-380, 2007. (Pubitemid 47582084)
23. L. Roditty, M. Thorup, and U. Zwick. Deterministic constructions of approximate distance oracles and spanners. In Proc. of International Colloquium on Algorithms, Languages and Programming (ICALP), pages 261-272, 2005. (Pubitemid 41436107)
24. L. Roditty and U. Zwick. Dynamic approximate all-pairs shortest paths in undirected graphs. In Proc. of the Symposium on Foundations of Computer Science (FOCS), pages 499-508, 2004. (Pubitemid 40575311)
25. Aleksandrs Slivkins. Distributed approaches to triangulation and embedding. In Proc. of the Symposium on Discrete Algorithms, pages 640-649, Philadelphia, PA, USA, 2005. Society for Industrial and Applied Mathematics. (Pubitemid 40851423)
26. C. Sommer, E. Verbin, and W. Yu. Distance oracles for sparse graphs. In Proc. of the Symposium on Foundations of Computer Science (FOCS), pages 703-712, 2009.
27. K. Talwar. Bypassing the embedding: algorithms for low dimensional metrics. In Proc. of ACM Symposium on Theory of Computing (STOC), pages 281-290, New York, NY, USA, 2004. ACM.
28. M. Thorup. Compact oracles for reachability and approximate distances in planar digraphs. Journal of the ACM, 51(6):993-1024, 2004. (Pubitemid 40818313)
29. M. Thorup and U. Zwick. Approximate distance oracles. Journal of the ACM, 52(1):1-24, 2005. (Pubitemid 43078379)