An improved approximation algorithm for the minimum 3-path partition problem (Q2424798)

From MaRDI portal
Revision as of 10:42, 15 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q128647257, #quickstatements; #temporary_batch_1723710233280)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An improved approximation algorithm for the minimum 3-path partition problem
scientific article

    Statements

    An improved approximation algorithm for the minimum 3-path partition problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 June 2019
    0 references
    0 references
    \(k\)-path partition
    0 references
    path cover
    0 references
    \(k\)-set cover
    0 references
    approximation algorithm
    0 references
    amortized analysis
    0 references
    0 references
    0 references