Maximum bipartite flow in networks with adaptive channel width (Q541660): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Algorithm Theory - SWAT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-norm approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial algorithms for the unsplittable flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the unsplittable flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002769 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Flow and Testing Graph Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond the flow decomposition barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the maximum-flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random sampling in residual graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of approximation: Gap location / rank
 
Normal rank

Latest revision as of 04:00, 4 July 2024

scientific article
Language Label Description Also known as
English
Maximum bipartite flow in networks with adaptive channel width
scientific article

    Statements

    Maximum bipartite flow in networks with adaptive channel width (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    7 June 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph algorithm
    0 references
    maximum flow
    0 references
    linear program rounding
    0 references
    wireless networks
    0 references
    adaptive channel width
    0 references
    0 references