We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
Abstract--This paper presents a novel loss recovery scheme, Active Reliable Multicast (ARM), for large-scale reliable multicast. ARM is "active" in that routers in the mu...
Li-Wei H. Lehman, Stephen J. Garland, David L. Ten...
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energyconstrained (e.g. battery-operated) nodes, by choosing ideal tran...