An approximation algorithm for \(P\)-prize-collecting set cover problem (Q2687689)

From MaRDI portal
Revision as of 19:19, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
An approximation algorithm for \(P\)-prize-collecting set cover problem
scientific article

    Statements

    An approximation algorithm for \(P\)-prize-collecting set cover problem (English)
    0 references
    0 references
    7 March 2023
    0 references
    \(P\)-prize-collecting set cover problem
    0 references
    approximation algorithm
    0 references
    primal-dual
    0 references
    Lagrangian relaxation
    0 references

    Identifiers