Approximation Algorithms for the Partition Vertex Cover Problem

DOI10.1007/978-3-642-36065-7_14zbMath1379.68346arXiv1112.1945OpenAlexW2172398637MaRDI QIDQ4914442

Shalmoli Gupta, Sambuddha Roy, Suman K. Bera, Amit Kumar

Publication date: 12 April 2013

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.1945

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)

Related Items (1)

Lift \& project systems performing on the partial-vertex-cover polytope

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