Some APX-completeness results for cubic graphs (Q1566710)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Some APX-completeness results for cubic graphs
scientific article

    Statements

    Some APX-completeness results for cubic graphs (English)
    0 references
    4 June 2000
    0 references
    0 references
    computational complexity
    0 references
    NP-hard optimization problems
    0 references
    approximation
    0 references
    APX-completeness
    0 references
    cubic graphs
    0 references
    0 references
    0 references
    0 references