On the hardness of finding near-optimal multicuts in directed acyclic graphs (Q719273)
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: On the hardness of finding near-optimal multicuts in directed acyclic graphs |
scientific article; zbMATH DE number 5955890
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the hardness of finding near-optimal multicuts in directed acyclic graphs |
scientific article; zbMATH DE number 5955890 |
Statements
On the hardness of finding near-optimal multicuts in directed acyclic graphs (English)
0 references
10 October 2011
0 references
multicuts
0 references
directed acyclic graphs
0 references
\(\mathcal{APX}\)-hardness
0 references
