An approximation algorithm for max \(k\)-uncut with capacity constraints (Q3225074)
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: An approximation algorithm for max k-uncut with capacity constraints |
scientific article; zbMATH DE number 6014921
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximation algorithm for max \(k\)-uncut with capacity constraints |
scientific article; zbMATH DE number 6014921 |
Statements
An approximation algorithm for max<i>k</i>-uncut with capacity constraints (English)
0 references
15 March 2012
0 references
Max \(k\)-uncut
0 references
capacity constraints
0 references
local search
0 references
unbalanced partition
0 references
0 references
0 references
0 references
0.858274519443512
0 references
0.8460599780082703
0 references
0.824489414691925
0 references
0.8238858580589294
0 references
