Pages that link to "Item:Q1791009"
From MaRDI portal
The following pages link to Partial sublinear time approximation and inapproximation for maximum coverage (Q1791009):
Displaying 7 items.
- A constructive proof of swap local search worst-case instances for the maximum coverage problem (Q1790189) (← links)
- Tight bounds on subexponential time approximation of set cover and related problems (Q2117696) (← links)
- Tight approximation bounds for combinatorial frugal coverage algorithms (Q2392738) (← links)
- Approximating subdense instances of covering problems (Q2840726) (← links)
- Partial Interval Set Cover – Trade-Offs between Scalability and Optimality (Q2851852) (← links)
- Linear Time Approximation Schemes for Geometric Maximum Coverage (Q3196415) (← links)
- Approximate set union via approximate randomization (Q5919116) (← links)