Sciweavers

854 search results - page 71 / 171
» A General Vehicle Routing Problem
Sort
View
COMPGEOM
2008
ACM
13 years 9 months ago
Routing a maximum number of disks through a scene of moving obstacles
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
Joondong Kim, Joseph S. B. Mitchell, Valentin Poli...
STOC
2007
ACM
109views Algorithms» more  STOC 2007»
14 years 8 months ago
Stability of the max-weight routing and scheduling protocol in dynamic networks and at critical loads
We study the stability of the Max-Weight protocol for combined routing and scheduling in communication networks. Previous work has shown that this protocol is stable for adversari...
Matthew Andrews, Kyomin Jung, Alexander L. Stolyar
PODC
2004
ACM
14 years 1 months ago
Compact routing on euclidian metrics
We consider the problem of designing a compact communication network that supports efficient routing in an Euclidean plane. Our network design and routing scheme achieves 1+ stret...
Ittai Abraham, Dahlia Malkhi
TON
2002
94views more  TON 2002»
13 years 7 months ago
Multicast routing and wavelength assignment in multihop optical networks
Abstract--This paper addresses multicast routing in circuitswitched multihop optical networks employing wavelength-division multiplexing. We consider a model in which multicast com...
Ran Libeskind-Hadas, Rami G. Melhem
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
13 years 9 months ago
IMproved results for route planning in stochastic transportation
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...
Justin A. Boyan, Michael Mitzenmacher