activity
20232025
most citedSemi-Bandit Learning for Monotone Stochastic Optimization

1 citations · 1 across the 3 of their papers we have counts for

collaborators
Showing 2024Show all

1 paper · 1 filter

cs.DS2024

Lower Bound on the Greedy Approximation Ratio for Adaptive Submodular Cover

Blake Harris, Viswanath Nagarajan

We show that the greedy algorithm for adaptive-submodular cover has approximation ratio at least 1.3*(1+ln Q). Moreover, the instance demonstrating this gap has Q=1. So, it invalid…