Fast equi-partitioning of rectangular domains using stripe decomposition (Q1383377)
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: Fast equi-partitioning of rectangular domains using stripe decomposition |
scientific article; zbMATH DE number 1139439
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast equi-partitioning of rectangular domains using stripe decomposition |
scientific article; zbMATH DE number 1139439 |
Statements
Fast equi-partitioning of rectangular domains using stripe decomposition (English)
0 references
13 April 1998
0 references
grid partitioning
0 references
\(k\)-way graph partition
0 references
quadratic assignment
0 references
near-optimal solutions
0 references
minimum perimeter problem
0 references
knapsack integer program
0 references
0.8104877471923828
0 references
0.8089408278465271
0 references
0.7455066442489624
0 references
