Pages that link to "Item:Q2117696"
From MaRDI portal
The following pages link to Tight bounds on subexponential time approximation of set cover and related problems (Q2117696):
Displaying 4 items.
- Efficient approximation of Min Set Cover by moderately exponential algorithms (Q1019736) (← links)
- \(O(n \log n)\) procedures for tightening cover inequalities (Q1124826) (← links)
- Tight approximation bounds for combinatorial frugal coverage algorithms (Q2392738) (← links)
- A Tight Bound for Stochastic Submodular Cover (Q5009701) (← links)