2 citations · 2 across the 4 of their papers we have counts for
4 papers
Online Algorithms with a Sample: Tight Bounds and Adversarial Robustness
Anish Hebbar, Ravi Kumar, Roie Levin +3
Suppose an online algorithm is given an unbiased -sample of its input as offline advice; can the algorithm exploit the sample to achieve beyond-worst-case performance? We study…
Learning-Augmented Algorithms for -median via Online Learning
Anish Hebbar, Rong Ge, Amit Kumar +1
The field of learning-augmented algorithms seeks to use ML techniques on past instances of a problem to inform an algorithm designed for a future instance. In this paper, we introd…
Bin Packing under Random-Order: Breaking the Barrier of 3/2
Anish Hebbar, Arindam Khan, K. V. N. Sreenivas
Best-Fit is one of the most prominent and practically used algorithms for the bin packing problem, where a set of items with associated sizes needs to be packed in the minimum numb…
Cyclability, Connectivity and Circumference
Niranjan Balachandran, Anish Hebbar
In a graph , a subset of vertices is said to be cyclable if there is a cycle containing the vertices in some order. is said to be -cyclable if any subs…