Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem (Q633844)
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: Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem |
scientific article; zbMATH DE number 5871669
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem |
scientific article; zbMATH DE number 5871669 |
Statements
Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem (English)
0 references
30 March 2011
0 references
\(k\)-way cut
0 references
approximation algorithm
0 references
