Pages that link to "Item:Q5302059"
From MaRDI portal
The following pages link to Improved Upper Bounds for Partial Vertex Cover (Q5302059):
Displaying 17 items.
- Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs (Q260267) (← links)
- Refined algorithms for hitting many intervals (Q344570) (← links)
- Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} (Q489714) (← links)
- Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover (Q714786) (← links)
- Parameterized algorithm for eternal vertex cover (Q765521) (← links)
- Calculating approximation guarantees for partial set cover of pairs (Q1676481) (← links)
- Subexponential algorithms for partial cover problems (Q1944141) (← links)
- Partial vertex cover on graphs of bounded degeneracy (Q2097233) (← links)
- Parameterized algorithms for graph partitioning problems (Q2408556) (← links)
- Exact algorithms for problems related to the densest \(k\)-set problem (Q2448865) (← links)
- Moderately exponential time and fixed parameter approximation algorithms (Q2868915) (← links)
- Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms (Q3656854) (← links)
- Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover (Q3656855) (← links)
- Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs (Q5041208) (← links)
- On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs (Q5084707) (← links)
- Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs (Q5361234) (← links)
- On the partial vertex cover problem in bipartite graphs -- a parameterized perspective (Q6151150) (← links)
