Multicast Routing and Design of Sparse Connectors

DOI10.1007/978-3-642-02094-0_12MaRDI QIDQ3637320zbMATH OpenOpenAlexFDO

Authors Andreas Baltz, Anand Srivastav

Publication date 9 July 2009

Published in Algorithmics of Large and Complex Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02094-0_12

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Communication networks in operations research (90B18)

Recommendations

• scientific article; zbMATH DE number 2011854
• Concurrent multicast in weighted networks
• Concurrent multicast in weighted networks
• Fast approximation of minimum multicast congestion – Implementation VERSUS Theory
• ON SOLVING MULTIMESSAGE MULTICASTING PROBLEMS

Cites work

• A natural randomization strategy for multicommodity flow and related algorithms
• A two‐stage network with dual partial concentrators
• Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time
• Construction of asymmetric connectors of depth two
• Constructions of sparse asymmetric connectors with number theoretic methods
• Expanders that beat the eigenvalue bound: Explicit construction and applications
• Extracting all the randomness and reducing the error in Trevisan's extractors
• Fast approximation algorithms for multicommodity flow problems
• Fast approximation of minimum multicast congestion – Implementation VERSUS Theory
• 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 2011854 (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?)
• Loss-less condensers, unbalanced expanders, and extractors
• On complexity, representation and approximation of integral multicommodity flows
• On rearrangeable and non-blocking switching networks
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• Power balance and apportionment algorithms for the United States Congress
• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• Randomized metarounding
• Rearrangeable Networks with Limited Depth
• Restricted set addition in groups. II: A generalization of the Erdős-Heilbronn conjecture
• The maximum concurrent flow problem

Cited in

(3)

• Routing in sparse splitting optical networks with multicast traffic.
• Biclique completion problems for multicast network design
• Optimization problems in multicast tree construction

This page was built for publication: Multicast Routing and Design of Sparse Connectors

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