Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem (Q633844): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00453-009-9316-1 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-009-9316-1 / rank | |||
Normal rank | |||
Revision as of 05:43, 9 December 2024
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
