An approximation algorithm for the \(k\)-prize-collecting multicut on a tree problem (Q2205937)

From MaRDI portal
Revision as of 06:15, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
An approximation algorithm for the \(k\)-prize-collecting multicut on a tree problem
scientific article

    Statements

    An approximation algorithm for the \(k\)-prize-collecting multicut on a tree problem (English)
    0 references
    0 references
    21 October 2020
    0 references
    multicut
    0 references
    \(k\)-prize-collecting multicut
    0 references
    approximation algorithm
    0 references
    primal-dual algorithm
    0 references
    Lagrange relaxation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references