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

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Klaus Jansen / rank
 
Normal rank
Property / author
 
Property / author: Marek Karpinski / rank
 
Normal rank
Property / author
 
Property / author: Andrzej Lingas / rank
 
Normal rank

Revision as of 22:10, 11 February 2024

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