552 search results - page 1 / 111 » Constrained Shortest Path Computation |
WEA
2005
Springer
13 years 10 months ago
2005
Springer
TON
2008
13 years 4 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
ESA
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
SSD
2005
Springer
13 years 10 months ago
2005
Springer
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
ESA
2000
Springer
13 years 8 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...