An approximation algorithm for max<i>k</i>-uncut with capacity constraints (Q3225074): Difference between revisions
From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710423558064 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/02331934.2011.592527 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2169649212 / rank | |||
Normal rank | |||
Revision as of 20:05, 19 March 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
