Approximation algorithms for the partition set cover problem with penalties
From MaRDI portal
Cites work
- A Greedy Heuristic for the Set-Covering Problem
- A threshold of ln n for approximating set cover
- A unified approach to approximating partial covering problems
- Algorithms for covering multiple submodular constraints and applications
- An approximation algorithm for \(P\)-prize-collecting set cover problem
- An approximation algorithm for the partial covering 0-1 integer program
- An efficient mean field approach to the set covering problem
- An iterative rounding 2-approximation algorithm for the k-partial vertex cover problem
- Approximation algorithm for the stochastic prize-collecting set multicover problem
- Approximation algorithm for vertex cover with multiple covering constraints
- Approximation algorithms for combinatorial problems
- Approximation algorithms for partial covering problems
- Approximation algorithms for the partition vertex cover problem
- Approximation Algorithms for the Set Covering and Vertex Cover Problems
- Approximation schemes for covering and packing problems in image processing and VLSI
- scientific article; zbMATH DE number 1445293 (Why is no real title available?)
- On colorful vertex and edge cover problems
- On the ratio of optimal integral and fractional covers
- Reducibility among combinatorial problems
- Set Partitioning: A survey
This page was built for publication: Approximation algorithms for the partition set cover problem with penalties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6976844)
