Pages that link to "Item:Q4366877"
From MaRDI portal
The following pages link to Approximate Set Covering in Uniform Hypergraphs (Q4366877):
Displayed 12 items.
- Randomized approximation for the set multicover problem in hypergraphs (Q262245) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Approximating vertex cover in dense hypergraphs (Q450531) (← links)
- The feedback arc set problem with triangle inequality is a vertex cover problem (Q486997) (← links)
- A randomised approximation algorithm for the hitting set problem (Q744051) (← links)
- An approximation algorithm for submodular hitting set problem with linear penalties (Q830939) (← links)
- On approximation of the vertex cover problem in hypergraphs (Q1779691) (← links)
- On a theorem of Lovász on covers in \(r\)-partite hypergraphs (Q1924486) (← links)
- Approximation of set multi-cover via hypergraph matching (Q2207501) (← links)
- Reconstruction of Kauffman networks applying trees (Q2497958) (← links)
- An approximation algorithm for the partial vertex cover problem in hypergraphs (Q5963655) (← links)
- Bounds on Ramsey games via alterations (Q6081572) (← links)