Approximating directed multicuts (Q2387182)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximating directed multicuts |
scientific article; zbMATH DE number 2201516
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating directed multicuts |
scientific article; zbMATH DE number 2201516 |
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
0.8790963888168335
0 references
0.8631598353385925
0 references
0.8626027703285217
0 references
0.8506866693496704
0 references
