A 5-approximation algorithm for the \(k\)-prize-collecting Steiner tree problem (Q2421447)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A 5-approximation algorithm for the \(k\)-prize-collecting Steiner tree problem
scientific article

    Statements

    A 5-approximation algorithm for the \(k\)-prize-collecting Steiner tree problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 June 2019
    0 references
    prize-collecting Steiner tree
    0 references
    \(k\)-MST
    0 references
    approximation algorithm
    0 references
    primal-dual relaxation
    0 references
    Lagrangean relaxation
    0 references

    Identifiers