Dynamic shortest paths containers

Electronic Notes in Theoretical Computer Science

Volumn 92, Issue , 2004, Pages 65-84

  Wagner, Dorothea ^a   Willhalm, Thomas ^a   Zaroliagis, Christos ^b  

^a UNIVERSITY OF KARLSRUHE   (Germany)

^b UNIVERSITY OF PATRAS   (Greece)

Author keywords

Dynamic shortest path; Geometric container; Graph layout

Indexed keywords

ALGORITHMS; DATA ACQUISITION; GRAPH THEORY; INFORMATION ANALYSIS; PROBLEM SOLVING; RAILROAD TRAFFIC CONTROL; SERVERS;

DYNAMIC SHORTEST PATH; GEOMETRIC CONTAINERS; GRAPH LAYOUT; INFORMATION SYSTEMS;

CONTAINERS;

EID: 18944403325     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2003.12.023     Document Type: Conference Paper

References (22)

1. Ausiello G., Italiano G.F., Marchetti-Spaccamela A., Nanni U. Incremental algorithms for minimal length paths. Journal of Algorithms. 12:1991;615-638
2. Barrett C., Bisset K., Jacob R., Konjevod G., Marathe M. Classical and contemporary shortest path problems in road networks: Implementation and experimental analysis of the transims router. Möhring R., Raman R. ESA 2002. LNCS. 2461:2002;126-138
3. Barrett C., Jacob R., Marathe M. Formal-language-constrained path problems. SIAM Journal on Computing. 30:2000;809-837 http://epubs.siam.org/sam- bin/dbq/article/33771
4. Demetrescu C., Italiano G.F. A new approach to dynamic all pairs shortest paths. Proceedings of the thirty-fifth ACM Symposium on Theory of Computing (STOC 2003). 2003;159-166 http://doi.acm.org/10.1145/780542.780567
5. Dijkstra E.W. A note on two problems in connexion with graphs. Numerische Mathematik. 1:1959;269-271
6. Even S., Gazit H. Updating distances in dynamic graphs. Methods of Operations Research. 49:1985;371-387
7. Frigioni D. Semidynamic algorithms for maintaining single-source shortest path trees. Algorithmica. 22:1998;250-274 http://www.springerlink.com/link.asp? id=23udd5uwx8lp
8. Frigioni D., Marchetti-Spaccamela A., Nanni U. Fully dynamic output bounded single source shortest path problem. SODA. 1996;212-221
9. King V. Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. Proc. 40th IEEE Symposium on Foundations of Computer Science (FOCS'99). 1999;81-91
10. Müller-Hannemann M., Weihe K. Pareto shortest paths is often feasible in practice. Brodal G., Frigioni D., Marchetti-Spaccamela A. WAE 2001. LNCS. 2461:2001;185-197
11. Nachtigall K. Time depending shortest-path problems with applications to railway networks. European Journal of Operational Research. 83:1995;154-166
12. Pohl I. Bi-directional search. Meltzer B., Michie D. Sixth Annual Machine Intelligence Workshop. Machine Intelligence. 6:1971;137-140
13. Preuss T., Syrbe J.-H. An integrated traffic information system. Proc. 6th Int. Conf. Appl. Computer Networking in Architecture, Construction, Design, Civil Eng., and Urban Planning (europIA '97). 1997
14. Ramalingam G., Reps T.W. An incremental algorithm for a generalization of the shortest-path problem. Journal of Algorithms. 21:1996;267-305
15. Ramalingam G., Reps T.W. On the computational complexity of dynamic graph problems. Theoretical Computer Science. 158:1996;233-277
16. Rohnert H. A dynamization of the all pairs least cost path problem. Proc. Symp. Theoretical Aspects of Computer Science (STACS'85). LNCS. 182:1985;279-286
17. Schulz F., Wagner D., Weihe K. Dijkstra's algorithm on-line: An empirical case study from public railroad transport. Journal of Experimental Algorithmics. 5:2000;http://www.jea.acm.org/2000/SchulzDijkstra/
18. Shekhar S., Fetterer A., Goyal B. Materialization trade-offs in hierarchical shortest path algorithms. Symposium on Large Spatial Databases. 1997;94-111
19. Siklóssy L., Tulp E. Trains, an active time-table searcher. Proc. 8th European Conf. Artificial Intelligence. 1988;170-175
20. Wagner D., Willhalm T. Geometric speed-up techniques for finding shortest paths in large sparse graphs. Proc. 11th European Symposium on Algorithms (ESA 2003). LNCS. 2003;. to appear
21. Zahn F.B., Noon C.E. A comparison between label-setting and label-correcting algorithms for computing one-to-one shortest paths. Journal of Geographic Information and Decision Analysis. 4:2000;http://www.geodec.org/
22. Zaroliagis C. Implementations and experimental studies of dynamic graph algorithms. Fleischer R., Moret B., Schmidt E.M. Experimental Algorithmics. LNCS. 2547:2002;229-278