33 search results - page 2 / 7 » Experimental Studies of Symbolic Shortest-Path Algorithms |
CPAIOR
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. Recently, new cost-based filtering algorithms for shorter-path constraints have been developed. However, so far only the theoretical properties of shorter-path constrain...
WADS
2005
Springer
13 years 11 months ago
2005
Springer
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
EDBT
2008
ACM
14 years 5 months ago
2008
ACM
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
CIKM
2009
Springer
13 years 12 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
WEA
2010
Springer
14 years 7 days ago
2010
Springer
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 ...