Pages that link to "Item:Q631761"
From MaRDI portal
The following pages link to Uniform unweighted set cover: the power of non-oblivious local search (Q631761):
Displaying 5 items.
- A GRASP algorithm to solve the unicost set covering problem (Q878597) (← links)
- Tight approximation bounds for combinatorial frugal coverage algorithms (Q2392738) (← links)
- Tight Approximation Bounds for Greedy Frugal Coverage Algorithms (Q3004668) (← links)
- Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search (Q5189513) (← links)
- On uniform covering, adaptive random search and raspberries (Q5927659) (← links)