Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts (Q5952050)
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: Approximation the minimum k-way cut in a graph via minimum 3-way cuts |
scientific article; zbMATH DE number 1687624
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts |
scientific article; zbMATH DE number 1687624 |
Statements
Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts (English)
0 references
8 January 2002
0 references
edge weighted undirected graph
0 references
approximation algorithm
0 references
0.8956915140151978
0 references
0.8777071833610535
0 references
