New Approximation Algorithms for the Vertex Cover Problem

DOI10.1007/978-3-642-45278-9_39zbMath1407.68543OpenAlexW159504299MaRDI QIDQ2870054

Christian Laforest, François Delbot, Raksmey Phan

Publication date: 17 January 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-45278-9_39

zbMATH Keywords

approximationlower boundvertex cover

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

This page was built for publication: New Approximation Algorithms for the Vertex Cover Problem