Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs (Q5700571)

From MaRDI portal
Revision as of 08:30, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 2220461
Language Label Description Also known as
English
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs
scientific article; zbMATH DE number 2220461

    Statements

    Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 October 2005
    0 references
    combinatorial optimization
    0 references
    NP-hardness
    0 references
    approximation algorithms
    0 references
    polynomial time approximation schemes
    0 references
    graph bisection
    0 references
    planar graphs
    0 references

    Identifiers

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