On the Approximability of the Vertex Cover and Related Problems
From MaRDI portal
Publication:3578370
DOI10.1007/978-3-642-14355-7_17zbMath1286.05136arXiv0712.3333OpenAlexW1627181101MaRDI QIDQ3578370
Abraham P. Punnen, Qiaoming Han
Publication date: 20 July 2010
Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0712.3333
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
