Approximating the minmax rooted-tree cover in a tree (Q2380018)

From MaRDI portal
Revision as of 20:09, 3 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Approximating the minmax rooted-tree cover in a tree
scientific article

    Statements

    Approximating the minmax rooted-tree cover in a tree (English)
    0 references
    0 references
    0 references
    24 March 2010
    0 references
    approximation algorithms
    0 references
    graph algorithms
    0 references
    tree partitioning
    0 references
    tree covers
    0 references
    combinatorial problems
    0 references
    design of algorithms
    0 references

    Identifiers