279 search results - page 5 / 56 » Reduction approaches for robust shortest path problems |
CORR
2008
Springer
14 years 9 months ago
2008
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
— The problem of finding an optimal path in an uncertain graph arises in numerous applications, including network routing, path-planning for vehicles, and the control of finite...
ORL
2008
14 years 9 months ago
2008
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
COLING
2008
14 years 11 months ago
2008
This paper presents an approach for substantially reducing the time needed to calculate the shortest paths between all concepts in a wordnet. The algorithm exploits the unique &qu...
ESA
2000
Springer
15 years 1 months ago
2000
Springer
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...