메뉴 건너뛰기




Volumn 5526 LNCS, Issue , 2009, Pages 125-136

Pareto paths with SHARC

Author keywords

[No Author keywords available]

Indexed keywords

DIJKSTRA'S ALGORITHMS; MULTI-CRITERIA; PARETO-OPTIMAL; ROAD NETWORK; SPEED-UPS; TRANSPORTATION NETWORK; TRAVEL COSTS; TRAVEL TIME;

EID: 68749111636     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02011-7_13     Document Type: Conference Paper
Times cited : (73)

References (17)
  • 1
    • 34147120474 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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
  • 6
    • 0023207978 scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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)
  • 9
    • 45449100446 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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)
  • 12
    • 57849102683 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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)


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.