552 search results - page 8 / 111 » Constrained Shortest Path Computation |
107
click to vote
STACS
2010
Springer
15 years 5 months ago
2010
Springer
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v ∈ V is said to be t-approximate shortest path if its length is at most t ...
85
Voted
ICIP
2004
IEEE
16 years 2 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...
97
Voted
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
118
click to vote
ICDCS
2011
IEEE
14 years 22 hour ago
2011
IEEE
—Routing is a critical operation in networks. In the context of data and sensor networks, routing strategies such as shortest-path, multi-path and potential-based (“all-path”...
95
Voted
JAL
2007
15 years 9 days ago
2007
Abstract. We consider the problem of estimating the length of a shortest path in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Init...