Approximation algorithms for the partition vertex cover problem
From MaRDI portal
Recommendations
- Approximation algorithms for the partition vertex cover problem
- An iterative rounding 2-approximation algorithm for the k-partial vertex cover problem
- Approximation algorithms for partial covering problems
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- scientific article; zbMATH DE number 1947055
Cites work
- scientific article; zbMATH DE number 5764796 (Why is no real title available?)
- scientific article; zbMATH DE number 1305393 (Why is no real title available?)
- scientific article; zbMATH DE number 1182766 (Why is no real title available?)
- scientific article; zbMATH DE number 1445293 (Why is no real title available?)
- A linear-time approximation algorithm for the weighted vertex cover problem
- A primal-dual approximation algorithm for partial vertex cover: Making educated guesses
- A threshold of ln n for approximating set cover
- Algorithms for facility location problems with outliers. (Extended abstract)
- Approximating the k-multicut problem
- Approximation algorithms for NP-hard problems.
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Approximation algorithms for partial covering problems
- Approximation of Partial Capacitated Vertex Cover
- Improved performance of the greedy algorithm for partial cover
- Maximizing a monotone submodular function subject to a matroid constraint
- Primal-Dual Schema for Capacitated Covering Problems
- Saving an epsilon: a 2-approximation for the k-MST problem in graphs
- Submodular function maximization via the multilinear relaxation and contention resolution schemes
Cited in
(22)- Algorithms for covering multiple submodular constraints and applications
- Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut
- A parameterized approximation scheme for generalized partial vertex cover
- Approximation algorithms for Min-k-overlap problems using the principal lattice of partitions approach
- Approximation algorithm for prize-collecting weighted set cover with fairness constraints
- The approximability of partial vertex covers in trees
- Approximation algorithms for the partition set cover problem with penalties
- A constant approximation for colorful k-center
- On colorful vertex and edge cover problems
- A factor 2 approximation algorithm for the vertex cover P₃ problem
- Approximation algorithms for the partition vertex cover problem
- Approximation algorithm for vertex cover with multiple covering constraints
- Approximation algorithm for vertex cover with multiple covering constraints
- Approximation algorithm for fair stochastic maximum coverage problem
- Approximation algorithm for prize-collecting hypergraph vertex cover with fairness constraints
- On fair covering and hitting problems
- Satisfiability to coverage in presence of fairness, matroid, and global constraints
- On generalizations of partial scenario set cover
- Approximation algorithm for prize-collecting vertex cover with fairness constraints
- Minimum power partial cover with fairness constraint
- Tight approximation for partial vertex cover with hard capacities
- Approximation of Partial Capacitated Vertex Cover
This page was built for publication: Approximation algorithms for the partition vertex cover problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744047)
