Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem (Q437058)

From MaRDI portal
Revision as of 12:08, 5 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
Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem
scientific article

    Statements

    Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem (English)
    0 references
    0 references
    0 references
    0 references
    17 July 2012
    0 references
    0 references
    \(k\)-fold dominating set
    0 references
    slab decomposition
    0 references
    algorithm
    0 references
    unit ball graph
    0 references
    0 references