Thumbnail
Access Restriction
Subscribed

Author Abraham, Ittai ♦ Delling, Daniel ♦ Goldberg, Andrew V. ♦ Werneck, Renato F.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2013
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Computer programming, programs & data
Subject Keyword Shortest paths ♦ Alternative paths ♦ Route planning ♦ Speed-up techniques
Abstract We study the problem of finding good alternative routes in road networks. We look for routes that are substantially different from the shortest path, have small stretch, and are locally optimal. We formally define the problem of finding alternative routes with a single via vertex, develop efficient algorithms for it, and evaluate them experimentally. Our algorithms are efficient enough for practical use and compare favorably with previous methods in both speed and solution quality.
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 2013-04-01
Publisher Place New York
e-ISSN 10846654
Journal Journal of Experimental Algorithmics (JEA)
Volume Number 18
Page Count 17
Starting Page 1.1
Ending Page 1.17


Open content in new tab

   Open content in new tab
Source: ACM Digital Library