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

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2019.03.004 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Using Homogeneous Weights for Approximating the Partial Cover Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Approximating (Sparse) Covering Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Resampling to Approximate Covering Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximability of Influence in Social Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Interdiction and Partial Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytical approach to parallel repetition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for partial covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular Function Minimization under Covering Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on submodular function minimization with covering type linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular Function Minimization under a Submodular Set Covering Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex cover might be hard to approximate to within \(2 - \varepsilon \) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for covering/packing integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to approximating partial covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ratio of optimal integral and fractional covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithm for partial positive influence problem in social network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local ratio method on partial set multi-cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal dual algorithm for partial set multi-cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bicriteria approximation algorithm for minimum submodular cost partial multi-cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved performance of the greedy algorithm for partial cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Extension of the Lovász Local Lemma, and its Applications to Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On positive influence dominating sets in social networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of the greedy algorithm for the submodular set covering problem / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128232644 / 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