An approximate max-flow min-cut relation for undirected multicommodity flow, with applications (Q1894701): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Philip N. Klein / rank
Normal rank
 
Property / author
 
Property / author: Satish B. Rao / rank
Normal rank
 
Property / author
 
Property / author: Philip N. Klein / rank
 
Normal rank
Property / author
 
Property / author: Satish B. Rao / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph-theoretic via minimization algorithm for two-layer printed circuit boards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Bipartization and via minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate max-flow min-(multi)cut theorems and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Commodity Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New problems complete for nondeterministic log space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluded minors, network decomposition, and multicommodity flow / 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: Q3775485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3346242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Algorithm for Small Separators in Arbitrary Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds on the max-flow min-cut ratio for multicommodity flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum concurrent flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Deletion Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:53, 23 May 2024

scientific article
Language Label Description Also known as
English
An approximate max-flow min-cut relation for undirected multicommodity flow, with applications
scientific article

    Statements

    An approximate max-flow min-cut relation for undirected multicommodity flow, with applications (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 April 1996
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    undirected multicommodity flow
    0 references
    multiway-cut problem
    0 references