Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
The steiner problem with edge lengths 1 and 2,
Information Processing Letters
A guided tour of Chernoff bounds
Information Processing Letters
A 1.598 approximation algorithm for the Steiner problem in graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Multicast Routing and Design of Sparse Connectors
Algorithmics of Large and Complex Networks
A survey of approximation algorithms for multicast congestion problems
TELE-INFO'06 Proceedings of the 5th WSEAS international conference on Telecommunications and informatics
Packing trees in communication networks
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Nash equilibria in all-optical networks
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Implementation of approximation algorithms for the multicast congestion problem
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
| Hi-index | 0.00 |
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.