Approximation algorithms for NP-complete problems on planar graphs (Q4299299)

From MaRDI portal
Revision as of 15:12, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article; zbMATH DE number 598341
Language Label Description Also known as
English
Approximation algorithms for NP-complete problems on planar graphs
scientific article; zbMATH DE number 598341

    Statements

    Approximation algorithms for NP-complete problems on planar graphs (English)
    0 references
    0 references
    1 March 1995
    0 references
    maximum H-matching
    0 references
    approximation schemes
    0 references
    maximum independent set
    0 references
    maximum tile salvage
    0 references
    minimum vertex cover
    0 references
    minimum dominating set
    0 references
    minimum edge dominating set
    0 references

    Identifiers