866 search results - page 46 / 174 » On Dynamic Shortest Paths Problems |
WEA
2010
Springer
14 years 2 months ago
2010
Springer
We study the problem of finding good alternative routes in road networks. We look for routes that are substantially different from the shortest path, have small stretch, and are ...
CPAIOR
2010
Springer
14 years 13 days ago
2010
Springer
Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algo...
GLOBECOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— A fundamental problem in quality-of-service (QoS) routing is to find a path connecting a source node to a destination node that satisfies K ≥ 2 additive QoS constraints. Th...
ICALP
1998
Springer
13 years 12 months ago
1998
Springer
Interval Routing Schemes (IRS for short) have been extensively investigated in the past years with special emphasis on shortest paths. Besides their theoretical interest, IRS have...
ICCSA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...