Pages that link to "Item:Q744051"
From MaRDI portal
The following pages link to A randomised approximation algorithm for the hitting set problem (Q744051):
Displayed 6 items.
- Randomized approximation for the set multicover problem in hypergraphs (Q262245) (← links)
- An approximation algorithm for submodular hitting set problem with linear penalties (Q830939) (← links)
- Parameterized complexity of \(d\)-hitting set with quotas (Q831823) (← links)
- Approximation algorithm for the multicovering problem (Q2025081) (← links)
- Approximation of set multi-cover via hypergraph matching (Q2207501) (← links)
- Minimal non-odd-transversal hypergraphs and minimal non-odd-bipartite hypergraphs (Q2213812) (← links)