Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs
From MaRDI portal
Publication:5041208
DOI10.1007/978-3-030-48966-3_30OpenAlexW3029871987MaRDI QIDQ5041208
No author found.
Publication date: 13 October 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.12011
Related Items (2)
On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs ⋮ On the partial vertex cover problem in bipartite graphs -- a parameterized perspective
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A unified approach to approximating partial covering problems
- Implicit branching and parameterized partial cover problems
- On the hardness of approximating minimum vertex cover
- Computing small partial coverings
- Optimization, approximation, and complexity classes
- The budgeted maximum coverage problem
- A primal-dual approximation algorithm for partial vertex cover: Making educated guesses
- The maximum vertex coverage problem on bipartite graphs
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
- Using Homogeneous Weights for Approximating the Partial Cover Problem
- Improved Approximation of Maximum Vertex Coverage Problem on Bipartite Graphs
- The Approximability of Partial Vertex Covers in Trees
- On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs
- Approximation algorithms for partial covering problems
- Reducibility among Combinatorial Problems
- On non-optimally expanding sets in Grassmann graphs
- Improved Upper Bounds for Partial Vertex Cover
- Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs
- Algorithms and Data Structures
- Partial vs. Complete Domination: t-Dominating Set
- Intuitive Algorithms and t-Vertex Cover
- Parameterized Algorithms
- Approximation of Partial Capacitated Vertex Cover
This page was built for publication: Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs
