The following pages link to Online maximum \(k\)-coverage (Q442204):
Displaying 10 items.
- On-line vertex-covering (Q1770381) (← links)
- Online variable sized covering (Q1854485) (← links)
- Online budgeted maximum coverage (Q1979466) (← links)
- Online algorithms for the maximum \(k\)-interval coverage problem (Q2091105) (← links)
- Better streaming algorithms for the maximum coverage problem (Q2322721) (← links)
- Optimal online \(k\)-min search (Q2516358) (← links)
- Online maximum \(k\)-interval coverage problem (Q2692231) (← links)
- Online k-max Search Algorithms with Applications to the Secretary Problem (Q2830073) (← links)
- Online Maximum k-Coverage (Q3088282) (← links)
- A fast tri-individual memetic search approach for the distance-based critical node problem (Q6167524) (← links)