96 search results - page 13 / 20 » Fast Exact MultiConstraint Shortest Path Algorithms |
ESA
2010
Springer
13 years 7 months ago
2010
Springer
We show how to route on very large public transportation networks (up to half a billion arcs) with average query times of a few milliseconds. We take into account many realistic fe...
SIAMSC
2010
13 years 1 months ago
2010
In this paper, we outline two improvements to the fast sweeping method to improve the speed of the method in general and more specifically in cases where the speed is changing rapi...
EOR
2007
13 years 6 months ago
2007
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
EMMCVPR
2003
Springer
13 years 12 months ago
2003
Springer
Common techniques for curve alignment find a solution in the form of a shortest network path by means of dynamic programming. In this paper we present an approach that employs Set...