-
1
-
-
34147120474
-
-
Dijkstra, E.W.: A Note on Two Problems in Connexion with Graphs. Numerische Mathematik 1, 269-271 (1959)
-
Dijkstra, E.W.: A Note on Two Problems in Connexion with Graphs. Numerische Mathematik 1, 269-271 (1959)
-
-
-
-
2
-
-
70349316563
-
-
Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering Route Planning Algorithms. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics of Large and Complex Networks. LNCS. Springer, Heidelberg (to appear 2009), http://i11www.ira.uka.de/extra/publications/dssw-erpa-09.pdf
-
Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering Route Planning Algorithms. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics of Large and Complex Networks. LNCS. Springer, Heidelberg (to appear 2009), http://i11www.ira.uka.de/extra/publications/dssw-erpa-09.pdf
-
-
-
-
3
-
-
0000072462
-
Bricriteria Path Problems
-
Fandel, G, Gal, T, eds, Springer, Heidelberg
-
Hansen, P.: Bricriteria Path Problems. In: Fandel, G., Gal, T. (eds.) Multiple Criteria Decision Making - Theory and Application, pp. 109-127. Springer, Heidelberg (1979)
-
(1979)
Multiple Criteria Decision Making - Theory and Application
, pp. 109-127
-
-
Hansen, P.1
-
6
-
-
0023207978
-
Approximation of Pareto Optima in Multiple-Objective Shortest-Path Problems
-
Warburton, A.: Approximation of Pareto Optima in Multiple-Objective Shortest-Path Problems. Operations Research 35(1), 70-79 (1987)
-
(1987)
Operations Research
, vol.35
, Issue.1
, pp. 70-79
-
-
Warburton, A.1
-
7
-
-
78650745824
-
-
Müller-Hannemann, M., Weihe, K.: Pareto Shortest Paths is Often Feasible in Practice. In: Brodal, G.S., Frigioni, D., Marchetti-Spaccamela, A. (eds.) WAE 2001. LNCS, 2141, pp. 185-197. Springer, Heidelberg (2001)
-
Müller-Hannemann, M., Weihe, K.: Pareto Shortest Paths is Often Feasible in Practice. In: Brodal, G.S., Frigioni, D., Marchetti-Spaccamela, A. (eds.) WAE 2001. LNCS, vol. 2141, pp. 185-197. Springer, Heidelberg (2001)
-
-
-
-
8
-
-
51149109592
-
Efficient Models for Timetable Information in Public Transportation Systems
-
Article 2.4
-
Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.: Efficient Models for Timetable Information in Public Transportation Systems. ACM Journal of Experimental Algorithmics 12, Article 2.4 (2007)
-
(2007)
ACM Journal of Experimental Algorithmics
, vol.12
-
-
Pyrga, E.1
Schulz, F.2
Wagner, D.3
Zaroliagis, C.4
-
9
-
-
45449100446
-
Finding All Attractive Train Connections by Multi-Criteria Pareto Search
-
Geraets, F, Kroon, L.G, Schoebel, A, Wagner, D, Zaroliagis, C.D, eds, Railway Optimization 2004, Springer, Heidelberg
-
Müller-Hannemann, M., Schnee, M.: Finding All Attractive Train Connections by Multi-Criteria Pareto Search. In: Geraets, F., Kroon, L.G., Schoebel, A., Wagner, D., Zaroliagis, C.D. (eds.) Railway Optimization 2004. LNCS, vol. 4359, pp. 246-263. Springer, Heidelberg (2007)
-
(2007)
LNCS
, vol.4359
, pp. 246-263
-
-
Müller-Hannemann, M.1
Schnee, M.2
-
10
-
-
45449101318
-
-
Disser, Y., Müller-Hannemann, M., Schnee, M.: Multi-Criteria Shortest Paths in Time-Dependent Train Networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, 5038, pp. 347-361. Springer, Heidelberg (2008)
-
Disser, Y., Müller-Hannemann, M., Schnee, M.: Multi-Criteria Shortest Paths in Time-Dependent Train Networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 347-361. Springer, Heidelberg (2008)
-
-
-
-
11
-
-
58349111148
-
SHARC: Fast and Robust Unidirectional Routing
-
Munro, I, Wagner, D, eds, SIAM, Philadelphia
-
Bauer, R., Delling, D.: SHARC: Fast and Robust Unidirectional Routing. In: Munro, I., Wagner, D. (eds.) Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX 2008), pp. 13-26. SIAM, Philadelphia (2008)
-
(2008)
Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX
, pp. 13-26
-
-
Bauer, R.1
Delling, D.2
-
12
-
-
57849102683
-
-
Delling, D.: Time-Dependent SHARC-Routing. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, 5193, pp. 332-343. Springer, Heidelberg (2008)
-
Delling, D.: Time-Dependent SHARC-Routing. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 332-343. Springer, Heidelberg (2008)
-
-
-
-
13
-
-
68749094271
-
-
Lauther, U.: An Extremely Fast, Exact Algorithm for Finding Shortest Paths in Static Networks with Geographical Background. In: Geoinformation und Mobilität - von der Forschung zur praktischen Anwendung. IfGI prints, 22, pp. 219-230 (2004)
-
Lauther, U.: An Extremely Fast, Exact Algorithm for Finding Shortest Paths in Static Networks with Geographical Background. In: Geoinformation und Mobilität - von der Forschung zur praktischen Anwendung. IfGI prints, vol. 22, pp. 219-230 (2004)
-
-
-
-
14
-
-
77953792590
-
Fast Point-to-Point Shortest Path Computations with Arc-Flags
-
Demetrescu, C, Goldberg, A.V, Johnson, D.S, eds, American Mathematical Society, Providence to appear
-
Hilger, M., Köhler, E., Möhring, R.H., Schilling, H.: Fast Point-to-Point Shortest Path Computations with Arc-Flags. In: Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.) Shortest Paths: Ninth DIMACS Implementation Challenge. DIMACS Book. American Mathematical Society, Providence (to appear, 2009)
-
(2009)
Shortest Paths: Ninth DIMACS Implementation Challenge. DIMACS Book
-
-
Hilger, M.1
Köhler, E.2
Möhring, R.H.3
Schilling, H.4
-
15
-
-
84940367177
-
-
Möhring, R.H., Schilling, H., Schütz, B., Wagner, D., Willhalm, T.: Partitioning Graphs to Speedup Dijkstra's Algorithm. ACM Journal of Experimental Algorithmics 11, 2.8 (2006)
-
Möhring, R.H., Schilling, H., Schütz, B., Wagner, D., Willhalm, T.: Partitioning Graphs to Speedup Dijkstra's Algorithm. ACM Journal of Experimental Algorithmics 11, 2.8 (2006)
-
-
-
-
17
-
-
68749118596
-
-
Delling, D., Sanders, P., Schultes, D., Wagner, D.: Highway Hierarchies Star. In: Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.) Shortest Paths: Ninth DIMACS Implementation Challenge. DIMACS Book. American Mathematical Society, Providence (to appear, 2009) (accepted for publication)
-
Delling, D., Sanders, P., Schultes, D., Wagner, D.: Highway Hierarchies Star. In: Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.) Shortest Paths: Ninth DIMACS Implementation Challenge. DIMACS Book. American Mathematical Society, Providence (to appear, 2009) (accepted for publication)
-
-
-
|