A 3-approximation algorithm for the maximum leaf \(k\)-forest problem (Q2413172)

From MaRDI portal
Revision as of 10:05, 15 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
A 3-approximation algorithm for the maximum leaf \(k\)-forest problem
scientific article

    Statements

    A 3-approximation algorithm for the maximum leaf \(k\)-forest problem (English)
    0 references
    0 references
    0 references
    0 references
    9 April 2018
    0 references
    approximation algorithms
    0 references
    maximum leaf spanning tree
    0 references
    \(k\)-forest
    0 references

    Identifiers