A nearly optimal algorithm for approximating replacement paths and k shortest simple paths in general graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2010, Pages 742-755

  Bernstein, Aaron ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS;

APPROXIMATE ALGORITHMS; EDGE WEIGHTS; EXACT ALGORITHMS; GENERAL GRAPH; OPTIMAL ALGORITHM; REPLACEMENT PATHS; RUNNING TIME; SHORTEST PATH;

APPROXIMATION ALGORITHMS;

EID: 77951669084     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973075.61     Document Type: Conference Paper

References (16)

1. A. BERNSTEIN AND D. KARGER, Improved distance sensitivity oracles via random sampling, in Proc. of the 19th SODA, San Francisco, California, 2008, pp. 34-43.
2. S. CHECHICK, M. LANGBERG, D. PELEG, AND L. RODITTY, f-sensitivity distance oracles, Unpublished Manuscript, (2009).
3. D. DOR, S. HALPERIN, AND U. ZWICK, All-pairs almost shortest paths, SIAM J. Comput., 29 (2000), pp. 1740-1759.
4. R. DUAN AND S. PETTIE, Dual-failure distance and connectivity oracles, in Proc. of the 20th SODA, New York, New York, 2009, pp. 506-515.
5. Y. EMEK, D. PELEG, AND L. RODITTY, A near-linear time algorithm for computing replacement paths in planar directed graphs, in Proc. of the 19th SODA, San Francisco, California, 2008, pp. 428-435.
6. D. EPPSTEIN, Finding the k shortest paths, SIAM J. Comput., 28 (1999), pp. 652-673.
7. M. L. FREDMAN AND R. E. TARJAN, Fibonacci heaps and their uses in improved network optimization algorithms, J. ACM, 34 (1987), pp. 596-615.
8. Z. GOTTHILF AND M. LEWENSTEIN, Improved algorithms for the k simple shortest paths and the replacement paths problems, Inf. Process. Lett., 109 (2009), pp. 352-355.
9. J. HERSHBERGER AND S. SURI, Vickrey prices and shortest paths: What is an edge worth?, in Proc. of the 42nd FOCS, Las Vegas, Nevada, USA, 2001, pp. 129-140. Erratum in FOCS '02.
10. J. HERSHBERGER, S. SURI, AND A. BHOSLE, On the difficulty of some shortest path problems, ACM Trans. Algorithms, 3 (2007), p. Article no. 5.
11. P. KLEIN, S. MOZES, AND O. WEIMANN, Shortest paths in directed planar graphs with negative lengths: a linear-space o(n log2 n)-time algorithm, in Proc. of the 19th SODA, New York, New York, 2009, pp. 236-245.
12. E. LAWLER, A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem, Management Science, 18 (1972), pp. 401-405.
13. K. MALIK, A. K. MITTAL, AND S. K. GUPTA, The k most vital arcs in the shortest path problem, Operations Research Letters, 4 (1989), pp. 223-227.
14. N. NISAN AND A. RONEN, Algorithmic mechanism design, Games and Economic Behavior, 35 (2001), pp. 166-196.
15. L. RODITTY, On the k-simple shortest paths problem in weighted directed graphs, in Proc. of the 18th SODA, New Orleans, Louisiana, 2007, pp. 920-928.
16. L. RODITTY AND U. ZWICK, Replacement paths and k simple shortest paths in unweighted directed graphs., in Proc. of the 32nd ICALP, Lisboa, Portugal, 2005, pp. 249-260.