We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...
Ashish Goel, Monika Rauch Henzinger, Serge A. Plot...
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm. We consider ...
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
We consider metrical task systems, a general framework to model online problems. Borodin, Linial and Saks [BLS92] presented a deterministic work function algorithm (WFA) for metric...