4 citations · 7 across the 7 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DS2021
Robust Secretary and Prophet Algorithms for Packing Integer Programs
C. J. Argue, Anupam Gupta, Marco Molinaro +1
We study the problem of solving Packing Integer Programs (PIPs) in the online setting, where columns in of the constraint matrix are revealed sequentially, and the goal i…
cs.DS2021
Lipschitz Selectors may not Yield Competitive Algorithms for Convex Body Chasing
C. J. Argue, Anupam Gupta, Marco Molinaro
The current best algorithms for convex body chasing problem in online algorithms use the notion of the Steiner point of a convex set. In particular, the algorithm which always move…