Approximating directed multicuts (Q2387182)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating directed multicuts |
scientific article |
Statements
Approximating directed multicuts (English)
0 references
26 January 2006
0 references
The authors consider the problem of finding a minimum multicut in a directed multicommodity flow network. The first nontrivial upper bounds on the max flow-to-min multicut ratio are obtained. These results are algorithmic, demonstrating nontrivial approximation guarantees.
0 references
approximation guarantees
0 references
polynomial-time algorithm
0 references
