Multicast Routing and Design of Sparse Connectors
From MaRDI portal
Publication:3637320
DOI10.1007/978-3-642-02094-0_12zbMath1248.90031OpenAlexW155670020MaRDI QIDQ3637320
Anand Srivastav, Andreas Baltz
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
Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Construction of asymmetric connectors of depth two
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- Expanders that beat the eigenvalue bound: Explicit construction and applications
- A natural randomization strategy for multicommodity flow and related algorithms
- On rearrangeable and non-blocking switching networks
- Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time
- Fast deterministic approximation for the multicommodity flow problem
- Fast approximation algorithms for multicommodity flow problems
- On complexity, representation and approximation of integral multicommodity flows
- Restricted set addition in groups. II: A generalization of the Erdős-Heilbronn conjecture
- The maximum concurrent flow problem
- Rearrangeable Networks with Limited Depth
- Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- Randomized metarounding
- Constructions of sparse asymmetric connectors with number theoretic methods
- Loss-less condensers, unbalanced expanders, and extractors
- A two‐stage network with dual partial concentrators
- Power balance and apportionment algorithms for the United States Congress
- Fast approximation of minimum multicast congestion – Implementation VERSUS Theory
- Extracting all the randomness and reducing the error in Trevisan's extractors
