A Randomised Approximation Algorithm for the Partial Vertex Cover Problem in Hypergraphs

DOI10.1007/978-3-642-34862-4_13zbMath1385.68051OpenAlexW1845958938MaRDI QIDQ4916041

Anand Srivastav, Mourad El Ouali, Helena Fohlin

Publication date: 19 April 2013

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-34862-4_13

zbMATH Keywords

combinatorial optimizationapproximation algorithmsvertex coverprobabilistic methodshypergarphs

Mathematics Subject Classification ID

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

This page was built for publication: A Randomised Approximation Algorithm for the Partial Vertex Cover Problem in Hypergraphs