Domination in graphs with bounded propagation: Algorithms, formulations and hardness results (Q987496)

From MaRDI portal
Revision as of 02:43, 3 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
scientific article

    Statements

    Domination in graphs with bounded propagation: Algorithms, formulations and hardness results (English)
    0 references
    0 references
    13 August 2010
    0 references
    dominating set
    0 references
    Ppower dominating set
    0 references
    planar graphs
    0 references
    approximation algorithms
    0 references
    PTAS
    0 references
    hardness of approximation
    0 references
    tree-width
    0 references
    integer programming
    0 references

    Identifiers