Combining Two Worlds: Parameterised Approximation for Vertex Cover
From MaRDI portal
Recommendations
- Vertex cover problem parameterized above and below tight bounds
- On the approximability of the vertex cover and related problems
- Algorithms and Data Structures
- Parameterized complexity of Vertex Cover variants
- Parameterized Reductions and Algorithms for Another Vertex Cover Generalization
- Approximation algorithm for vertex cover with multiple covering constraints
- Approximation algorithm for vertex cover with multiple covering constraints
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover}
- \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms
- scientific article; zbMATH DE number 3853131
Cited in
(13)- A novel parameterised approximation algorithm for \textsc{minimum vertex cover}
- Parameterized approximation algorithms for packing problems
- Computing and Combinatorics
- One for the price of two: a unified approach for approximating covering problems
- Super-polynomial approximation branching algorithms
- Moderately exponential approximation: bridging the gap between exact computation and polynomial approximation
- Data reductions and combinatorial bounds for improved approximation algorithms
- Parameterized approximation algorithms for weighted vertex cover
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem
- Parameterized approximation via fidelity preserving transformations
- Approximation algorithms inspired by kernelization methods
- Saving on phases: parameterized approximation for total vertex cover
- Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics
This page was built for publication: Combining Two Worlds: Parameterised Approximation for Vertex Cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3060750)
