Fast balanced partitioning is hard even on grids and trees (Q388790): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: METIS / rank | |||
Normal rank | |||
Revision as of 04:30, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast balanced partitioning is hard even on grids and trees |
scientific article |
Statements
Fast balanced partitioning is hard even on grids and trees (English)
0 references
7 January 2014
0 references
balanced partitioning
0 references
bicriteria approximation
0 references
inapproximability
0 references
grid graphs
0 references
trees
0 references
