Greedy approximation for the minimum connected dominating set with labeling (Q828691)

From MaRDI portal
Revision as of 17:34, 25 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
Greedy approximation for the minimum connected dominating set with labeling
scientific article

    Statements

    Greedy approximation for the minimum connected dominating set with labeling (English)
    0 references
    0 references
    0 references
    0 references
    5 May 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    greedy algorithm
    0 references
    connected dominating set
    0 references
    approximation algorithm
    0 references
    performance ratio
    0 references
    labeling
    0 references
    0 references