Bounded-leg distance and reachability oracles

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 436-445

  Duan, Ran ^a   Pettie, Seth ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT MODELLING; PATH ALGORITHM; PATH PROBLEMS; PATH QUERIES; PREPROCESSING TIME; REACH ABILITY; REACHABILITY QUERIES; TIME-SPACE;

ALGORITHMS; AUTOMOBILE FUEL TANKS; DATA STRUCTURES; FUEL TANKS; STANDARDS; WIRELESS SENSOR NETWORKS;

GRAPH THEORY;

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

References (20)

1. S. Baswana and T. Kavitha. Faster algorithms for approximate distance oracles and all-pairs small stretch paths. In Proc. 47th IEEE Symposium on Foundations of Computer Science (FOCS), pages 591-602, 2006.
2. 2) time. ACM Trans. Algorithms, 2(4):557-577, 2006.
3. 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.
4. T. M. Chan. More algorithms for all-pairs shortest paths in weighted graphs. In STOC '07: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pages 590-598, New York, NY, USA, 2007. ACM Press.
5. C. Demetrescu and G. F. Italiano. A new approach to dynamic all pairs shortest paths. In Proc. 35th ACM Symp. on the Theory of Computing, 2003.
6. J. Fakcharoenphol and S. Rao. Planar graphs, negative weight edges, shortest paths, and near linear time. J. Comput. System Sci., 72(5):868-889, 2006.
7. H. N. Gabow and R. E. Tarjan. Algorithms for two bottleneck optimization problems. J. Algorithms, 9(3):411-417, 1988.
8. P. N. Klein. Preprocessing an undirected planar network to enable fast approximate distance queries. In Proc. 13th Ann. ACM-SIAM Symp. On Discrete Algorithms (SODA), pages 820-827, 2002.
9. P. N. Klein and S. Subramanian. A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs. In Algorithms and data structures (Montreal, PQ, 1993), volume 709 of Lecture Notes in Comput. Sci., pages 442-451. Springer, Berlin, 1993.
10. L. Kowalik and M. Kurowski. Oracles for boundedlength shortest paths in planar graphs. ACM 'Trans. Algorithms, 2(3):335-363, 2006.
11. M. Mendel and A. Naor. Ramsey partitions and proximity data structures. J. Eur. Math. Soc. (JEMS), 9(2):253-275, 2007.
12. S. Pettie. A new approach to all-pairs shortest paths on real-weighted graphs. Theoret. Comput. Sci., 312(1):47-74, 2004.
13. L. Roditty. A faster and simpler fully dynamic transitive closure. In SODA '03: Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, pages 404-412, Philadelphia, PA, USA, 2003. Society for Industrial and Applied Mathematics.
14. L. Roditty and M. Segal. On bounded leg shortest paths problems. In SODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, pages 775-784, Philadelphia, PA, USA, 2007. Society for Industrial and Applied Mathematics.
15. L. Roditty, M. Thorup, and U. Zwick. Deterministic constructions of approximate distance oracles and spanners. In Automata, languages and programming, volume 3580 of Lecture Notes in Comput. Sci., pages 261-272. Springer, Berlin, 2005.
16. L. Roditty and U. Zwick. Improved dynamic reachability algorithms for directed graphs. In FOCS '02: Proceedings of the 43rd Symposium on Foundations of Computer Science, page 679, Washington, DC, USA, 2002. IEEE Computer Society.
17. S. Subramanian. A fully dynamic data structure for reachability in planar digraphs. In Algorithms-ESA '93 (Bad Honnef, 1993), volume 726 of Lecture Notes in Comput. Sci., pages 372-383. Springer, Berlin, 1993.
18. M. Thorup. Compact oracles for reachability and approximate distances in planar digraphs. J. ACM, 51(6):993-1024 (electronic), 2004.
19. M. Thorup and U. Zwick. Approximate distance oracles. J. ACM, 52(1):1-24 (electronic), 2005.
20. V. Vassilevska, R. Williams, and R. Yuster. Allpairs bottleneck paths for general graphs in truly sub-cubic time. In STOC '07: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pages 585-589, New York, NY, USA, 2007. ACM Press.