Approximating Multicast Congestion
We present a randomized algorithm for approximating multicast congestion (a generalization of path congestion) to within O(log n) times the best possible. Our main tools are a linear programming relaxation and iterated randomized rounding.
Unable to display preview. Download preview PDF.
- 2.M. Grötschel, L. Lovász and A. Schrijver, Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, 1987.Google Scholar
- 3.S. Hougardy and H. J. Promel, A 1.598 approximation algorithm for the steiner problem in graphs. Proc. 10th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM, 448–453, 1999.Google Scholar
- 5.R. M. Karp, Reducibility among combinatorial problems. Complexity of Computer Computations, R. E. Miller, J. W. Thatcher, Eds., Plenum Press, New York, 85–103, 1972.Google Scholar