Cites work
- A fast approximation algorithm for the multicovering problem
- A Greedy Heuristic for the Set-Covering Problem
- A linear-time approximation algorithm for the weighted vertex cover problem
- A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover
- A threshold of ln n for approximating set cover
- Algorithmic construction of sets for k -restrictions
- An analysis of the greedy algorithm for the submodular set covering problem
- An improved approximation algorithm for vertex cover with hard capacities
- Analytical approach to parallel repetition
- Approximation algorithms for combinatorial problems
- Approximation algorithms for covering/packing integer programs
- Approximation Algorithms for the Set Covering and Vertex Cover Problems
- Capacitated vertex covering
- Covering Problems with Hard Capacities
- scientific article; zbMATH DE number 1559563 (Why is no real title available?)
- scientific article; zbMATH DE number 1445293 (Why is no real title available?)
- On the hardness of approximating minimization problems
- On the ratio of optimal integral and fractional covers
- Online primal-dual algorithms for covering and packing
- Randomized approximation of bounded multicovering problems
- Shrinking maxima, decreasing costs: new online packing and covering problems
- The importance of being biased
- The online set cover problem
- The Online Submodular Cover Problem
- Tight Approximation Bounds for the Seminar Assignment Problem
- Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
This page was built for publication: Online multiset submodular cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6582377)
