Fast approximation of minimum multicast congestion – Implementation VERSUS Theory

DOI10.1051/RO:2004028MaRDI QIDQ5693011zbMATH OpenOpenAlexFDO

Authors Andreas Baltz, Anand Srivastav

Publication date 28 September 2005

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=RO_2004__38_4_319_0, https://eudml.org/doc/105318, https://semanticscholar.org/paper/2fc497d4cc3615ae2884a19200b5a0dea6e1b404

zbMATH Keywords

approximation algorithmsCombinatorial optimization

Mathematics Subject Classification ID

Approximation algorithms (68W25) Communication networks in operations research (90B18) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 2011854
• Experimental and Efficient Algorithms
• scientific article; zbMATH DE number 1522943
• Approximation algorithms for general packing problems and their application to the multicast congestion problem
• Computing and Combinatorics

Cites work

• A faster approximation algorithm for the Steiner problem in graphs
• A natural randomization strategy for multicommodity flow and related algorithms
• Fast Approximation Algorithms for Fractional Packing and Covering Problems
• Fast approximation algorithms for multicommodity flow problems
• Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints
• Fast deterministic approximation for the multicommodity flow problem
• Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts
• scientific article; zbMATH DE number 1187163 (Why is no real title available?)
• scientific article; zbMATH DE number 1522943 (Why is no real title available?)
• scientific article; zbMATH DE number 1445376 (Why is no real title available?)
• On complexity, representation and approximation of integral multicommodity flows
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• Randomized metarounding (extended abstract)
• The maximum concurrent flow problem

Cited in

(10)

• Packing trees in communication networks
• scientific article; zbMATH DE number 5454665 (Why is no real title available?)
• Multicast Routing and Design of Sparse Connectors
• scientific article; zbMATH DE number 2011854 (Why is no real title available?)
• scientific article; zbMATH DE number 1522943 (Why is no real title available?)
• scientific article; zbMATH DE number 1532270 (Why is no real title available?)
• Experimental and Efficient Algorithms
• Construction algorithms and approximation bounds for the streaming cache placement problem in multicast networks
• Approximation algorithms for general packing problems and their application to the multicast congestion problem
• On routing in VLSI design and communication networks

This page was built for publication: Fast approximation of minimum multicast congestion – Implementation VERSUS Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5693011)