866 search results - page 60 / 174 » On Dynamic Shortest Paths Problems |
ICC
2011
IEEE
12 years 7 months ago
2011
IEEE
— Anypath routing, a new routing paradigm, has been proposed to improve the performance of wireless networks by exploiting the spatial diversity and broadcast nature of the wirel...
ISCC
2005
IEEE
14 years 1 months ago
2005
IEEE
The problem of computing bandwidth guaranteed paths for given flow requests in an ad-hoc network is complicated because neighboring links share the medium. We define the path wi...
ICOIN
2001
Springer
14 years 3 days ago
2001
Springer
This paper investigates the problem of path calcul ation of multiple metric routing. Toda ’s Internet routing is based on a single metric path selecting algorithm. Single metric...
EOR
2007
13 years 7 months ago
2007
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...
ESA
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we study several routing problems that generalize shortest paths and the Traveling Salesman Problem. We consider a more general model that incorporates the actual co...