Nondecreasing paths in a weighted graph or: How to optimally read a train schedule *

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 465-472

  Vassilevska, Virginia ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DEPARTURE TIMES; SINGLE SOURCING; TRAIN SCHEDULING;

GRAPH THEORY; PROGRAMMING THEORY;

ALGORITHMS;

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

References (25)

1. R. Bellman. On a Routing Problem. Quarterly of Applied Mathematics, 16(1), 87-90, 1958.
2. G. Brodal and R. Jacob. Time-dependent networks as models to achieve fast exact time-table queries. In Proceedings of ATMOS Workshop 2003, Electronic Notes in Theoretical Computer Science 92, 2004.
3. T. M. Chan. More Algorithms for All-Pairs Shortest Paths in Weighted Graphs. In Proc. of STOC, 2007.
4. D. Coppersmith, S. Winograd, Matrix multiplication via arithmetic progressions. J. Symbolic Computation 9(3):251-280, 1990.
5. E. W. Dijkstra. A note on two problems in connection with graphs. Numer. Math., 269-271, 1959.
6. L. R. Ford. Network flow theory. Technical Report Paper P-923, The Rand Corporation, Santa Monica, 1956.
7. M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. JACM 34(3):596-615, 1987.
8. M. L. Fredman and D. E. Willard. Transdichotomous Algorithms for Minimum Spanning Trees and Shortest Paths. JCSS 48:533-551, 1994.
9. Z. Galil and O. Margalit. All pairs shortest paths for graphs with small integer length edges. JCSS 54:243-254, 1997.
10. A. Goldberg. Scaling algorithms for the shortest paths problem. In Proc. of SODA, 222-231, 1993.
11. 5/4) Time Algorithm for All Pairs Shortest Paths. In Proc. of ESA, Springer-Verlag LNCS 4168:411-417, 2006.
12. M. Kowaluk and A. Lingas. LCA queries in directed acyclic graphs. In Proc. of ICALP, Springer-Verlag LNCS 3580:241-248, 2005.
13. n. Information Processing Letters 38(5):277-278, 1991.
14. G. J. Minty. A Variant on the Shortest-Route Problem, Operations Research, 6(6):882-883, 1958.
15. E. F. Moore. The shortest path through a maze. In Proceedings of an International Symposium on the Theory of Switching, 285-292, 2-5 April 1957, Part II, 1959.
16. E. Pyrga, F. Schulz, D. Wagner, and C. Zaroliagis. Efficient models for timetable information in public transportation systems. J. Exp. Algorithmics 12, 2007.
17. F. Schulz, D. Wagner, and C. D. Zaroliagis. Using Multi-level Graphs for Timetable Information in Railway Systems. In Revised Papers From the 4th international Workshop on Algorithm Engineering and Experiments. D. M. Mount and C. Stein, Eds. Lecture Notes In Computer Science 2409, 43-59, 2002.
18. R. Seidel. On the all-pairs-shortest-path problem in unweighted undirected graphs. JCSS 51:400-403, 1995.
19. A. Shapira, R. Yuster and U. Zwick. All-Pairs Bottleneck Paths in Vertex Weighted Graphs. In Proc. of SODA, 978-985, 2007.
20. A. Shoshan and U. Zwick. All Pairs Shortest Paths in Undirected Graphs with Integer Weights. In Proc. of FOGS, 605-614, 1999.
21. R. E. Tarjan, Private communication.
22. M. Thorup. Undirected single-source shortest paths with positive integer weights in linear time. J. ACM 46(3):362-394, 1999.
23. 3-δ time, with applications. In Proc. of STOC, 225-231, 2006.
24. V. Vassilevska, R. Williams and R. Yuster. All-Pairs Bottleneck Paths For General Graphs in Truly Sub-Cubic Time. In Proc. of STOC, 2007.
25. U. Zwick. All pairs shortest paths using bridging sets and rectangular matrix multiplication. JACM 49(3):289-317, 2002.