An approximation algorithm for max<i>k</i>-uncut with capacity constraints (Q3225074): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:08, 4 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approximation algorithm for max<i>k</i>-uncut with capacity constraints |
scientific article |
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
