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...
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
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...
Abstract--This paper addresses multicast routing in circuitswitched multihop optical networks employing wavelength-division multiplexing. We consider a model in which multicast com...
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...