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

From MaRDI portal
Revision as of 22:32, 4 April 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q60630618, #quickstatements; #temporary_batch_1712261475387)
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