Pages that link to "Item:Q744051"
From MaRDI portal
The following pages link to A randomised approximation algorithm for the hitting set problem (Q744051):
Displaying 9 items.
- Randomized approximation for the set multicover problem in hypergraphs (Q262245) (← links)
- An improved algorithm for the red-blue hitting set problem with the consecutive ones property (Q407573) (← links)
- An approximation algorithm for submodular hitting set problem with linear penalties (Q830939) (← links)
- Parameterized complexity of \(d\)-hitting set with quotas (Q831823) (← links)
- Parameterized algorithms for \(d\)-hitting set: the weighted case (Q964386) (← 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)
- Sharp concentration of hitting size for random set systems (Q2345531) (← links)