On approximating (connected) 2-edge dominating set by a tree (Q1635808)

From MaRDI portal
Revision as of 23:55, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On approximating (connected) 2-edge dominating set by a tree
scientific article

    Statements

    On approximating (connected) 2-edge dominating set by a tree (English)
    0 references
    0 references
    0 references
    1 June 2018
    0 references
    edge dominating sets
    0 references
    approximation algorithms
    0 references
    tree cover
    0 references
    connected dominating sets
    0 references
    \(b\)-edge domination
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers