An <i>O</i>(log <i>k</i>) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm (Q4388872)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1150637
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8541964888572693
0 references
0.8523794412612915
0 references
0.8512301445007324
0 references
