96 search results - page 7 / 20 » Fast Exact MultiConstraint Shortest Path Algorithms |
ICIP
2004
IEEE
14 years 8 months ago
2004
IEEE
We present a new semi-automatic segmentation tool, which is motivated by the Intelligent Scissors algorithm [1], but which uses a modified concept of user-interaction. This new in...
FOCS
1998
IEEE
13 years 11 months ago
1998
IEEE
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different ap...
TALG
2008
13 years 6 months ago
2008
The Fibonacci heap was devised to provide an especially efficient implementation of Dijkstra's shortest path algorithm. Although asyptotically efficient, it is not as fast in...
COCOON
2001
Springer
13 years 11 months ago
2001
Springer
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
EOR
2010
13 years 1 months ago
2010
The vehicle routing problem with multiple use of vehicles is a variant of the classical vehicle routing problem. It arises when each vehicle performs several routes during the wor...