A parameterized approximation scheme for generalized partial vertex cover
From MaRDI portal
Publication:6138992
DOI10.1007/978-3-031-38906-1_7MaRDI QIDQ6138992FDOQ6138992
Authors: Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi 
Publication date: 16 January 2024
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Cites Work
- The hardness of approximation: Gap location
- Computing small partial coverings
- Parameterized complexity of Vertex Cover variants
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
- Approximation algorithms for maximization problems arising in graph partitioning
- Parameterized algorithms
- A better approximation ratio for the vertex cover problem
- Multi-budgeted matchings and matroid intersection via dependent rounding
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
- Nondeterminism within $P^ * $
- Approximating multiobjective knapsack problems
- Capacitated Domination and Covering: A Parameterized Perspective
- The importance of being biased
- On the Parameterized Complexity of Approximating Dominating Set
- Title not available (Why is that?)
- Algorithms and Data Structures
- Enumerate and expand: Improved algorithms for connected vertex cover and tree cover
- Approximation algorithms for the partition vertex cover problem
- Algorithms for covering multiple submodular constraints and applications
- On partial covering for geometric set systems
- Fair colorful \(k\)-center clustering
- A technique for obtaining true approximations for \(k\)-center with covering constraints
- A constant approximation for colorful \(k\)-center
- On approximating (sparse) covering integer programs
- On fair covering and hitting problems
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)
