A novel parameterised approximation algorithm for \textsc{minimum vertex cover}

DOI10.1016/j.tcs.2012.12.003zbMath1407.68542MaRDI QIDQ392028

Henning Fernau, Ljiljana Brankovic

Publication date: 13 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.12.003

zbMATH Keywords

approximation algorithms; vertex cover; parameterised algorithms

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms