Multicast Routing and Design of Sparse Connectors (Q3637320): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-02094-0_12 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W155670020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4437506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximation of minimum multicast congestion – Implementation VERSUS Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions of sparse asymmetric connectors with number theoretic methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4511239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized metarounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum concurrent flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A natural randomization strategy for multicommodity flow and related algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximation algorithms for multicommodity flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast deterministic approximation for the multicommodity flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line routing of virtual circuits with applications to load balancing and machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On complexity, representation and approximation of integral multicommodity flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic construction of deterministic algorithms: approximating packing integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power balance and apportionment algorithms for the United States Congress / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rearrangeable Networks with Limited Depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rearrangeable and non-blocking switching networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two‐stage network with dual partial concentrators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted set addition in groups. II: A generalization of the Erdős-Heilbronn conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loss-less condensers, unbalanced expanders, and extractors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extracting all the randomness and reducing the error in Trevisan's extractors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expanders that beat the eigenvalue bound: Explicit construction and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of asymmetric connectors of depth two / rank
 
Normal rank

Latest revision as of 19:06, 1 July 2024

scientific article
Language Label Description Also known as
English
Multicast Routing and Design of Sparse Connectors
scientific article

    Statements

    Multicast Routing and Design of Sparse Connectors (English)
    0 references
    0 references
    0 references
    9 July 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references