854 search results - page 66 / 171 » A General Vehicle Routing Problem |
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
ICALP
2001
Springer
14 years 6 days ago
2001
Springer
In contrast to classical offline k-k routing, the online packet routing problem allows for an arbitrary number of packets with arbitrary end points and release times. We study this...
INFOCOM
1998
IEEE
13 years 12 months ago
1998
IEEE
We consider the problem of routing connections with quality of service (QoS) requirements across networks when the information available for making routing decisions is inaccurate....
MOBIHOC
2006
ACM
14 years 7 months ago
2006
ACM
Message ferrying is a networking paradigm where a special node, called a message ferry, facilitates the connectivity in a mobile ad hoc network where the nodes are sparsely deploy...
BROADNETS
2007
IEEE
14 years 2 months ago
2007
IEEE
— Traffic engineering has been extensively studied to maximize network resource utilization while minimizing call blocking [1]. As the the demand for high data rate services ove...