A parameterized approximation scheme for generalized partial vertex cover
From MaRDI portal
Cites work
- A better approximation ratio for the vertex cover problem
- A constant approximation for colorful k-center
- A technique for obtaining true approximations for k-center with covering constraints
- Algorithms and Data Structures
- Algorithms for covering multiple submodular constraints and applications
- Approximating multiobjective knapsack problems
- Approximation algorithms for maximization problems arising in graph partitioning
- Approximation algorithms for the partition vertex cover problem
- Capacitated Domination and Covering: A Parameterized Perspective
- Computing small partial coverings
- Enumerate and expand: Improved algorithms for connected vertex cover and tree cover
- Fair colorful \(k\)-center clustering
- scientific article; zbMATH DE number 1342117 (Why is no real title available?)
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
- Multi-budgeted matchings and matroid intersection via dependent rounding
- Nondeterminism within $P^ * $
- On approximating (sparse) covering integer programs
- On fair covering and hitting problems
- On partial covering for geometric set systems
- On the Parameterized Complexity of Approximating Dominating Set
- Parameterized algorithms
- Parameterized complexity of Vertex Cover variants
- The hardness of approximation: Gap location
- The importance of being biased
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
This page was built for publication: A parameterized approximation scheme for generalized partial vertex cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6138992)
