137 search results - page 12 / 28 » Optimising Node Coordinates for the Shortest Path Problem |
JCT
1998
13 years 7 months ago
1998
We introduce a concept of so-called disjoint ordering for any collection of finite sets. It can be viewed as a generalization of a system of distinctive representatives for the s...
ICNP
2005
IEEE
14 years 29 days ago
2005
IEEE
Routing in mobile ad hoc networks remains as a challenging problem given the limited wireless bandwidth, users’ mobility and potentially large scale. Recently, there has been a ...
CCCG
2008
13 years 8 months ago
2008
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...
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...
COREGRID
2007
Springer
14 years 1 months ago
2007
Springer
We address the problem of routing packets on multiple, router-disjoint, paths in the Internet using large-scale overlay networks. Multipath routing can improve Internet QoS, by rou...