23 citations · 48 across the 24 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.DS2023★ 1 cited
Constrained Submodular Maximization via New Bounds for DR-Submodular Functions
Niv Buchbinder, Moran Feldman
Submodular maximization under various constraints is a fundamental problem studied continuously, in both computer science and operations research, since the late 's. A centra…
cs.DS2023
Maintaining Matroid Intersections Online
Niv Buchbinder, Anupam Gupta, Daniel Hathcock +2
Maintaining a maximum bipartite matching online while minimizing recourse/augmentations is a well studied problem, motivated by content delivery, job scheduling, and hashing. A bre…
cs.DS2023
Chasing Positive Bodies
Sayan Bhattacharya, Niv Buchbinder, Roie Levin +1
We study the problem of chasing positive bodies in : given a sequence of bodies revealed online…