메뉴 건너뛰기




Volumn 14, Issue , 2010, Pages 88-99

Fast detour computation for ride sharing

Author keywords

Algorithm engineering; Carpool; Ride sharing

Indexed keywords

ALGORITHM ENGINEERING; CARPOOL; INTERNET SERVICES; ORIGIN AND DESTINATIONS; POPULATION DENSITIES; RIDE-SHARING; STATIC ALGORITHMS; WASTE OF RESOURCES;

EID: 84872771596     PISSN: 21906807     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/OASIcs.ATMOS.2010.88     Document Type: Conference Paper
Times cited : (43)

References (15)
  • 1
    • 34247610284 scopus 로고    scopus 로고
    • Fast routing in road networks with transit nodes
    • Holger Bast, Stefan Funke, Peter Sanders, and Dominik Schultes. Fast Routing in Road Networks with Transit Nodes. Science, 316(5824):566, 2007.
    • (2007) Science , vol.316 , Issue.5824 , pp. 566
    • Bast, H.1    Funke, S.2    Sanders, P.3    Schultes, D.4
  • 4
    • 34147120474 scopus 로고
    • A note on two problems in connexion with graphs
    • Edsger W. Dijkstra. 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
  • 6
    • 79955809738 scopus 로고    scopus 로고
    • Master's thesis, Universität Karlsruhe (TH), Fakultät für Informatik
    • Robert Geisberger. Contraction Hierarchies. Master's thesis, Universität Karlsruhe (TH), Fakultät für Informatik, 2008. http://algo2.iti.uni-karlsruhe.de/documents/routeplanning/geisberger-dipl.pdf.
    • (2008) Contraction Hierarchies
    • Geisberger, R.1
  • 11
    • 0016564037 scopus 로고
    • On finding the maxima of a set of vectors
    • H. T. Kung, Fabrizio Luccio, and F. P. Preparata. On Finding the Maxima of a Set of Vectors. Journal of the ACM, 22(4):469-476, 1975.
    • (1975) Journal of the ACM , vol.22 , Issue.4 , pp. 469-476
    • Kung, H.T.1    Luccio, F.2    Preparata, F.P.3


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