Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem (Q633844)
From MaRDI portal
scientific article
| 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 |
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
