Approximate Set Covering in Uniform Hypergraphs
From MaRDI portal
Publication:4366877
DOI10.1006/jagm.1997.0872zbMath0888.68089OpenAlexW2066723908MaRDI QIDQ4366877
Publication date: 25 November 1997
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1997.0872
Related Items (12)
An approximation algorithm for submodular hitting set problem with linear penalties ⋮ On a theorem of Lovász on covers in \(r\)-partite hypergraphs ⋮ On vertex independence number of uniform hypergraphs ⋮ Bounds on Ramsey games via alterations ⋮ Approximation of set multi-cover via hypergraph matching ⋮ Approximating vertex cover in dense hypergraphs ⋮ The feedback arc set problem with triangle inequality is a vertex cover problem ⋮ Reconstruction of Kauffman networks applying trees ⋮ On approximation of the vertex cover problem in hypergraphs ⋮ An approximation algorithm for the partial vertex cover problem in hypergraphs ⋮ A randomised approximation algorithm for the hitting set problem ⋮ Randomized approximation for the set multicover problem in hypergraphs
This page was built for publication: Approximate Set Covering in Uniform Hypergraphs