Implementation of approximation algorithms for the multicast congestion problem

Authors:
Qiang Lu;Hu Zhang
Affiliations:
College of Civil Engineering and Architecture, Zhejiang University, Hangzhou, China;Department of Computing and Software, McMaster University, Hamilton, Ontario, Canada
Venue:
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Year:
2005

Citing 18
Cited 6

Randomized rounding: a technique for provably good algorithms and algorithmic proofs

Combinatorica - Theory of Computing
A faster approximation algorithm for the Steiner problem in graphs

Information Processing Letters
Probabilistic construction of deterministic algorithms: approximating packing integer programs

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
The steiner problem with edge lengths 1 and 2,

Information Processing Letters
A note on “A faster approximation algorithm for the Steiner problem in graphs”

Information Processing Letters
Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts

SIAM Journal on Computing
Coordination complexity of parallel price-directive decomposition

Mathematics of Operations Research
On-line routing of virtual circuits with applications to load balancing and machine scheduling

Journal of the ACM (JACM)
Proof verification and the hardness of approximation problems

Journal of the ACM (JACM)
Randomized metarounding (extended abstract)

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Improved Steiner tree approximation in graphs

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The multicast packing problem

IEEE/ACM Transactions on Networking (TON)
Approximation Hardness of the Steiner Tree Problem on Graphs

SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Approximating Multicast Congestion

ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Approximation Algorithms for General Packing Problems with Modified Logarithmic Potential Function

TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A survey of combinatorial optimization problems in multicast routing

Computers and Operations Research
Fast approximation of minimum multicast congestion: implementation versus theory

CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity

Assign ranges in general ad-hoc networks

Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Faster and simpler approximation algorithms for mixed packing and covering problems

Theoretical Computer Science
On routing in VLSI design and communication networks

Discrete Applied Mathematics
Implementation of approximation algorithms for the max-min resource sharing problem

WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Packing trees in communication networks

WINE'05 Proceedings of the First international conference on Internet and Network Economics
An approximation algorithm for the general mixed packing and covering problem

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing problems in [13]. We use an approximate minimum Steiner tree solver as an oracle in our implementation. Furthermore, we design some heuristics for our implementation such that both the quality of solution and the running time are improved significantly, while the correctness of the solution is preserved. We also present brief analysis of these heuristics. Numerical results are reported for large scale instances. We show that our implementation results are much better than the results of a theoretically good algorithm in [10].