Approximation Algorithms and Hardness for Domination with Propagation (Q5901420)

From MaRDI portal
Revision as of 21:58, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5508569
Language Label Description Also known as
English
Approximation Algorithms and Hardness for Domination with Propagation
scientific article; zbMATH DE number 5508569

    Statements

    Approximation Algorithms and Hardness for Domination with Propagation (English)
    0 references
    0 references
    0 references
    17 February 2009
    0 references
    approximation algorithms
    0 references
    hardness of approximation
    0 references
    PTAS
    0 references
    dominating set
    0 references
    power dominating set
    0 references
    planar graphs
    0 references
    integer programming
    0 references
    greedy algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references