Thumbnail
Access Restriction
Subscribed

Author Bauer, Reinhard ♦ Delling, Daniel ♦ Sanders, Peter ♦ Schieferdecker, Dennis ♦ Schultes, Dominik ♦ Wagner, Dorothea
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2011
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Computer programming, programs & data
Subject Keyword Dijkstra's algorithm ♦ Speed-up technique
Abstract In recent years, highly effective hierarchical and goal-directed speed-up techniques for routing in large road networks have been developed. This article makes a systematic study of combinations of such techniques. These combinations turn out to give the best results in many scenarios, including graphs for unit disk graphs, grid networks, and time-expanded timetables. Besides these quantitative results, we obtain general insights for successful combinations.
ISSN 10846654
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2010-03-01
Publisher Place New York
e-ISSN 10846654
Journal Journal of Experimental Algorithmics (JEA)
Volume Number 15
Page Count 31
Starting Page 2.1
Ending Page 2.31


Open content in new tab

   Open content in new tab
Source: ACM Digital Library