Fast balanced partitioning is hard even on grids and trees (Q388790)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6243128
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast balanced partitioning is hard even on grids and trees |
scientific article; zbMATH DE number 6243128 |
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
0 references
0 references
0 references
0.9973703026771544
0 references
0.8902589082717896
0 references
0.8670876622200012
0 references
0.8391234874725342
0 references
0.8130320310592651
0 references
