Hardness results and approximation algorithms for (weighted) paired-domination in graphs (Q1034626)

From MaRDI portal
Revision as of 10:22, 11 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Hardness results and approximation algorithms for (weighted) paired-domination in graphs
scientific article

    Statements

    Hardness results and approximation algorithms for (weighted) paired-domination in graphs (English)
    0 references
    0 references
    0 references
    0 references
    6 November 2009
    0 references
    approximation algorithms
    0 references
    \(APX\)-complete
    0 references
    combinatorial problems
    0 references
    domination problems
    0 references
    paired-domination
    0 references

    Identifiers