Approximate Set Covering in Uniform Hypergraphs
From MaRDI portal
Recommendations
- Approximation of set multi-cover via hypergraph matching
- Randomized approximation for the set multicover problem in hypergraphs
- Set-cover approximation
- Approximating set multi-covers
- Improved bounds for covering complete uniform hypergraphs
- Covering non-uniform hypergraphs
- On approximation of the vertex cover problem in hypergraphs
- Approximation of sets based on partial covering
- Approximation of sets based on partial covering
- Approximating vertex cover in dense hypergraphs
Cited in
(18)- Randomized approximation for the set multicover problem in hypergraphs
- An approximation algorithm for submodular hitting set problem with linear penalties
- An approximation algorithm for the k-prize-collecting hitting set problem
- A randomised approximation algorithm for the hitting set problem
- An approximation algorithm for the partial vertex cover problem in hypergraphs
- On vertex independence number of uniform hypergraphs
- On approximation of the vertex cover problem in hypergraphs
- Approximation algorithm for the multicovering problem
- Fractional v. integral covers in hypergraphs of bounded edge size
- The covering radius problem for sets of 1-factors of the complete uniform hypergraphs
- Improved bounds for covering complete uniform hypergraphs
- On a theorem of Lovász on covers in \(r\)-partite hypergraphs
- Reconstruction of Kauffman networks applying trees
- Some combinatorial algorithms on the edge cover number of \(k\)-regular connected hypergraphs
- The feedback arc set problem with triangle inequality is a vertex cover problem
- Bounds on Ramsey games via alterations
- Approximation of set multi-cover via hypergraph matching
- Approximating vertex cover in dense hypergraphs
This page was built for publication: Approximate Set Covering in Uniform Hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4366877)
