Fast balanced partitioning is hard even on grids and trees (Q388790): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68W25 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C70 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q17 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6243128 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
balanced partitioning | |||
| Property / zbMATH Keywords: balanced partitioning / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
bicriteria approximation | |||
| Property / zbMATH Keywords: bicriteria approximation / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
inapproximability | |||
| Property / zbMATH Keywords: inapproximability / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
grid graphs | |||
| Property / zbMATH Keywords: grid graphs / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
trees | |||
| Property / zbMATH Keywords: trees / rank | |||
Normal rank | |||
Revision as of 13:33, 29 June 2023
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
