Approximate Max \(k\)-Cut with subgraph guarantee (Q293220)
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: Approximate Max \(k\)-Cut with subgraph guarantee |
scientific article; zbMATH DE number 6590680
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximate Max \(k\)-Cut with subgraph guarantee |
scientific article; zbMATH DE number 6590680 |
Statements
Approximate Max \(k\)-Cut with subgraph guarantee (English)
0 references
9 June 2016
0 references
approximation
0 references
Max \(k\)-Cut
0 references
spanning subgraphs
0 references
induced subgraphs
0 references
