On bounded leg shortest paths problems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 775-784

  Roditty, Liam ^a   Segal, Michael ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; DIRECTED GRAPHS; SET THEORY;

EUCLIDEAN METRICS; EXACT ALGORITHMS; GEOMETRIC SPANNER; METRIC SPACES; MULTIPLICATIVE ERRORS; QUERY POINTS; SHORTEST PATH; WEIGHTED DIRECTED GRAPH;

GRAPH THEORY;

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

References (25)

1. Pankaj K. Agarwal, Alon Efrat, and Micha Sharir. Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications. SIAM Journal on Computing, 29:912-953, 1999.
2. Pankaj K. Agarwal and Jeff Erickson. Geometric range searching and its relatives. In B. Chazelle, J. E. Goodman, and R. Pollack, editors, Advances in Discrete and Computational Geometry, volume 223 of Contemporary Mathematics, pages 1-56. American Mathematical Society, Providence, RI, 1999.
3. A. Aggarwal, M. Hansen, and T. Leighton. Solving query-retrieval problems by compacting Voronoi diagrams. In Proc. 22nd Annu. ACM Sympos. Theory Comput., pages 331-340, 1990.
4. S. Arya, G. Das, D. M. Mount, J. S. Salowe, and M. Smid. Euclidean spanners: short, thin, and lanky. In Proceedings of the 27th ACM Symposium on the Theory of Computing, pages 489-498, 1995.
5. 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.
6. S. Baswana and S. Sen. A simple linear time algorithm for computing a (2k-1)-spanner of O(n-1+1/k) size in weighted graphs. In ICALP: Annual International Colloquium on Automata, Languages and Programming, 2003.
7. J. L. Bentley and J. B. Saxe. Decomposable searching problems I: Static-to-dynamic transformations. J. Algorithms, 1:301-358, 1980.
8. P. Bose, A. Meheswari, G. Narasimhan, M. Smid, and N. Zeh. Approximating geometric bottleneck shortest paths. Computational Geometry: Theory and Applications, 29:233-249, 2004.
9. 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.
10. T. M. Chan. Dynamic planar convex hull operations in near-logarithmic amortized time. J. ACM, 48:1-12, 2001.
11. Timothy M. Chan. A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries. ACM-SIAM Symposium on Discrete Algorithms, 2006.
12. Timothy M. Chan and Alon Efrat. Fly cheaply: On the minimum fuel consumption problem. J. Algorithms, 41:330-337, 2001.
13. Bernard Chazelle. On the convex layers of a planar set. IEEE Trans. Inform. Theory, IT-31(4):509-517, July 1985.
14. Bernard Chazelle and F. P. Preparata. Halfspace range search: An algorithmic application of k-sets. Discrete Comput. Geom., 1:83-93, 1986.
15. Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, Germany, 2nd edition, 2000.
16. Michael Elkin and David Peleg. (1+epsilon, beta)-spanner constructions for general graphs. In STOC, pages 173-182, 2001.
17. D. Eppstein. Dynamic Euclidean minimum spanning trees and extrema of binary functions. Discrete Comput. Geom., 13:111-122, 1995.
18. J. Hershberger and S. Suri. Applications of a semi-dynamic convex hull algorithm. BIT, 32:249-267, 1992.
19. S. Kapoor and M. Smid. New techniques for exact and approximate dynamic closest-point problems. SIAM J. Comput., 25:775-796, 1996.
20. J. Matoušek. Efficient partition trees. Discrete Comput. Geom., 8:315-334, 1992.
21. S. Pettie. A new approach to all-pairs shortest paths on real-weighted graphs. Theoretical Computer Science, 312(1):47-74, 2004.
22. M. Thorup. Undirected single-source shortest paths with positive integer weights in linear time. Journal of the ACM, 46(3):362-394, 1999.
23. Mikkel Thorup and Uri Zwick. Approximate distance oracles. In STOC, pages 183-192, 2001.
24. 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.
25. U. Zwick. All pairs shortest paths using bridging sets and rectangular matrix multiplication. Journal of the ACM, 49(3):289-317, 2002.