An <i>O</i>(log <i>k</i>) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm (Q4388872): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:01, 7 February 2024
scientific article; zbMATH DE number 1150637
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An <i>O</i>(log <i>k</i>) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm |
scientific article; zbMATH DE number 1150637 |
Statements
An <i>O</i>(log <i>k</i>) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm (English)
0 references
10 May 1998
0 references
approximation algorithm
0 references
sparse cuts
0 references
network flow
0 references
multicommodity flow
0 references
concurrent flow
0 references
