Fast balanced partitioning is hard even on grids and trees (Q388790)

From MaRDI portal
Revision as of 16:06, 9 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references