Fast balanced partitioning is hard even on grids and trees (Q388790): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2013.03.014 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2013.03.014 / rank | |||
Normal rank | |||
Latest revision as of 16:06, 9 December 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
0 references
0 references
0 references
