Abstract
We present a randomized algorithm for approximating multicast congestion (a generalization of path congestion) to within О (log n) times the best possible. Our main tools are a linear programming relaxation and iterated randomized rounding.
Cite
CITATION STYLE
APA
Vempala, S., & Vöcking, B. (1999). Approximating multicast congestion. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1741, pp. 367–372). Springer Verlag. https://doi.org/10.1007/3-540-46632-0_37
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free