353 search results - page 7 / 71 » Two-phase Algorithms for the Parametric Shortest Path Proble... |
114
click to vote
ESA
2004
Springer
15 years 8 months ago
2004
Springer
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
134
Voted
PVLDB
2010
15 years 1 months ago
2010
The current widespread use of location-based services and GPS technologies has revived interest in very fast and scalable shortest path queries. We introduce a new shortest path q...
166
click to vote
PPSN
2010
Springer
15 years 15 days ago
2010
Springer
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
135
Voted
CAINE
2004
15 years 4 months ago
2004
The problem of finding a shortest path is common to many different fields including transportation systems, mechanical systems and computer communications. Most telecommunication ...
143
click to vote
ALGORITHMICA
2011
14 years 9 months ago
2011
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...