Parameterized Reductions and Algorithms for Another Vertex Cover Generalization
DOI10.1007/978-3-642-22300-6_24zbMATH Open1260.68446OpenAlexW110066549MaRDI QIDQ5199249FDOQ5199249
Authors: Peter Damaschke, Leonid Molokov 
Publication date: 12 August 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22300-6_24
Recommendations
- Algorithms and Data Structures
- Parameterized complexity of Vertex Cover variants
- scientific article; zbMATH DE number 3853131
- Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover
- Vertex cover structural parameterization revisited
- The generalized vertex cover problem and some variations
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
- scientific article; zbMATH DE number 1830723
- Vertex cover problem parameterized above and below tight bounds
- On the approximability of the vertex cover and related problems
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (5)
- A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem
- Combining Two Worlds: Parameterised Approximation for Vertex Cover
- Kernelization and parameterized complexity of star editing and union editing
- Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover
- Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics
This page was built for publication: Parameterized Reductions and Algorithms for Another Vertex Cover Generalization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5199249)
