메뉴 건너뛰기




Volumn 6049 LNCS, Issue , 2010, Pages 47-58

Space-efficient SHARC-routing

Author keywords

[No Author keywords available]

Indexed keywords

LONG-PATH; QUERY PERFORMANCE; RAPID DEVELOPMENT; ROAD NETWORK; SPACE CONSUMPTION; SPACE OVERHEAD; TIME-DEPENDENT; TRAVEL TIME; TRAVEL TIME FUNCTIONS;

EID: 78650668833     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13193-6_5     Document Type: Conference Paper
Times cited : (10)

References (21)
  • 1
    • 84880392207 scopus 로고    scopus 로고
    • Time-dependent contraction hierarchies
    • SIAM, Philadelphia
    • Batz, G.V., Delling, D., Sanders, P., Vetter, C.: Time-Dependent Contraction Hierarchies. In: ALENEX, pp. 97-105. SIAM, Philadelphia (2009).
    • (2009) ALENEX , pp. 97-105
    • Batz, G.V.1    Delling, D.2    Sanders, P.3    Vetter, C.4
  • 2
    • 78650673054 scopus 로고    scopus 로고
    • Time-dependent contraction hierarchies and approximation
    • Festa, P. (ed.), LNCS, Springer, Heidelberg
    • Batz, G.V., Geisberger, R., Neubauer, S., Sanders, P.: Time-Dependent Contraction Hierarchies and Approximation. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 166-177. Springer, Heidelberg (2010).
    • (2010) SEA 2010 , vol.6049 , pp. 166-177
    • Batz, G.V.1    Geisberger, R.2    Neubauer, S.3    Sanders, P.4
  • 4
    • 0038415995 scopus 로고    scopus 로고
    • Compact representation of separable graphs
    • SIAM, Philadelphia
    • Blandford, D.K., Blelloch, G.E., Kash, I.A.: Compact Representation of Separable Graphs. In: SODA, pp. 679-688. SIAM, Philadelphia (2003).
    • (2003) SODA , pp. 679-688
    • Blandford, D.K.1    Blelloch, G.E.2    Kash, I.A.3
  • 5
    • 8344250217 scopus 로고    scopus 로고
    • An experimental analysis of a compact graph representation
    • SIAM, Philadelphia
    • Blandford, D.K., Blelloch, G.E., Kash, I.A.: An Experimental Analysis of a Compact Graph Representation. In: ALENEX, pp. 49-61. SIAM, Philadelphia (2004).
    • (2004) ALENEX , pp. 49-61
    • Blandford, D.K.1    Blelloch, G.E.2    Kash, I.A.3
  • 6
    • 0014814325 scopus 로고
    • Space/time trade-offs in hash coding with allowable errors
    • Bloom, B.H.: Space/Time Trade-offs in Hash Coding with Allowable Errors. Communications of the ACM 13(7), 422-426 (1970).
    • (1970) Communications of the ACM , vol.13 , Issue.7 , pp. 422-426
    • Bloom, B.H.1
  • 8
    • 70350417561 scopus 로고    scopus 로고
    • Time-dependent SHARC-routing
    • July
    • Delling, D.: Time-Dependent SHARC-Routing. Algorithmica (July 2009).
    • (2009) Algorithmica
    • Delling, D.1
  • 9
    • 70349316563 scopus 로고    scopus 로고
    • Engineering route planning algorithms
    • Lerner, J.Wagner, D. Zweig, K.A. (eds.), LNCS, Springer, Heidelberg
    • 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, vol. 5515, pp. 117-139. Springer, Heidelberg (2009).
    • (2009) Algorithmics of Large and Complex Networks , vol.5515 , pp. 117-139
    • Delling, D.1    Sanders, P.2    Schultes, D.3    Wagner, D.4
  • 10
    • 68749111636 scopus 로고    scopus 로고
    • Pareto paths with SHARC
    • Vahrenhold, J. (ed.), LNCS, Springer, Heidelberg
    • Delling, D., Wagner, D.: Pareto Paths with SHARC. In: Vahrenhold, J. (ed.) SEA 2009. LNCS, vol. 5526, pp. 125-136. Springer, Heidelberg (2009).
    • (2009) SEA 2009 , vol.5526 , pp. 125-136
    • Delling, D.1    Wagner, D.2
  • 11
    • 77956298183 scopus 로고    scopus 로고
    • Time-dependent route planning
    • Zaroliagis, C. (ed.), LNCS, Springer, Heidelberg
    • Delling, D., Wagner, D.: Time-Dependent Route Planning. In: Zaroliagis, C. (ed.) Robust and Online Large-Scale Optimization. LNCS, vol. 5868, pp. 207-230. Springer, Heidelberg (2009).
    • (2009) Robust and Online Large-Scale Optimization , vol.5868 , pp. 207-230
    • Delling, D.1    Wagner, D.2
  • 12
    • 34147120474 scopus 로고
    • A note on two problems in connexion with graphs
    • Dijkstra, E.W.: A Note on Two Problems in Connexion with Graphs. Numerische Mathematik 1, 269-271 (1959).
    • (1959) Numerische Mathematik , vol.1 , pp. 269-271
    • Dijkstra, E.W.1
  • 13
    • 45449120587 scopus 로고    scopus 로고
    • Contraction hierarchies: Faster and simpler hierarchical routing in road networks
    • McGeoch, C.C. (ed.), LNCS, Springer, Heidelberg
    • Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 319-333. Springer, Heidelberg (2008).
    • (2008) WEA 2008 , vol.5038 , pp. 319-333
    • Geisberger, R.1    Sanders, P.2    Schultes, D.3    Delling, D.4
  • 14
    • 20744448516 scopus 로고    scopus 로고
    • Computing the shortest path: A* search meets graph theory
    • Goldberg, A.V., Harrelson, C.: Computing the Shortest Path: A* Search Meets Graph Theory. In: SODA, pp. 156-165 (2005).
    • (2005) SODA , pp. 156-165
    • Goldberg, A.V.1    Harrelson, C.2
  • 15
    • 32144437248 scopus 로고    scopus 로고
    • Computing point-to-point shortest paths from external memory
    • SIAM, Philadelphia
    • Goldberg, A.V., Werneck, R.F.: Computing Point-to-Point Shortest Paths from External Memory. In: ALENEX, pp. 26-40. SIAM, Philadelphia (2005).
    • (2005) ALENEX , pp. 26-40
    • Goldberg, A.V.1    Werneck, R.F.2
  • 16
    • 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
    • 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.) The Shortest Path Problem: Ninth DIMACS Implementation Challenge. DIMACS Book, vol. 74, pp. 41-72. American Mathematical Society, Providence (2009).
    • (2009) The Shortest Path Problem: Ninth DIMACS Implementation Challenge. DIMACS Book , vol.74 , pp. 41-72
    • Hilger, M.1    Köhler, E.2    Möhring, R.H.3    Schilling, H.4
  • 17
    • 24944471617 scopus 로고    scopus 로고
    • An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background
    • IfGI prints
    • 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, vol. 22, pp. 219-230. IfGI prints (2004).
    • (2004) Geoinformation und Mobilität - Von der Forschung zur Praktischen Anwendung , vol.22 , pp. 219-230
    • Lauther, U.1
  • 19
    • 45449112583 scopus 로고    scopus 로고
    • Bidirectional A* search for time-dependent fast paths
    • McGeoch, C.C. (ed.), LNCS, Springer, Heidelberg
    • Nannicini, G., Delling, D., Liberti, L., Schultes, D.: Bidirectional A* Search for Time-Dependent Fast Paths. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 334-346. Springer, Heidelberg (2008).
    • (2008) WEA 2008 , vol.5038 , pp. 334-346
    • Nannicini, G.1    Delling, D.2    Liberti, L.3    Schultes, D.4
  • 21
    • 57749183618 scopus 로고    scopus 로고
    • Mobile route planning
    • Halperin, D. Mehlhorn, K. (eds.) E, LNCS, Springer, Heidelberg
    • Sanders, P., Schultes, D., Vetter, C.: Mobile Route Planning. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 732-743. Springer, Heidelberg (2008).
    • (2008) SA 2008 , vol.5193 , pp. 732-743
    • Sanders, P.1    Schultes, D.2    Vetter, C.3


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