Saving on phases: parameterized approximation for total vertex cover

DOI10.1007/978-3-642-35926-2_3MaRDI QIDQ2876553zbMATH OpenOpenAlexFDO

Authors Henning Fernau

Publication date 19 August 2014

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-35926-2_3

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Recommendations

• Combining Two Worlds: Parameterised Approximation for Vertex Cover
• A novel parameterised approximation algorithm for \textsc{minimum vertex cover}
• Parameterized complexity of Vertex Cover variants
• The curse of connectivity: \(t\)-total vertex (edge) cover
• Algorithms and Data Structures

Cited in

(4)

• Parameterized approximation via fidelity preserving transformations
• Parameterized approximation via fidelity preserving transformations
• A novel parameterised approximation algorithm for \textsc{minimum vertex cover}
• On the parameterized complexity of vertex cover and edge cover with connectivity constraints

This page was built for publication: Saving on phases: parameterized approximation for total vertex cover

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2876553)