A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem (Q2282997): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q128232644, #quickstatements; #temporary_batch_1722799621482
Import241208061232 (talk | contribs)
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2019.03.004 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2019.03.004 / rank
 
Normal rank

Latest revision as of 19:46, 17 December 2024

scientific article
Language Label Description Also known as
English
A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem
scientific article

    Statements

    A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 December 2019
    0 references
    partial cover
    0 references
    multi-cover
    0 references
    submodular cover
    0 references
    bicriteria algorithm
    0 references
    0 references

    Identifiers

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