Author

Roie Levin

Tel Aviv University

h-index 8 Homepage View on Semantic Scholar

We have 2 of 22 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Online Algorithms with a Sample: Tight Bounds and Adversarial Robustness

Suppose an online algorithm is given an unbiased $p$-sample of its input as offline advice; can the algorithm exploit the sample to achieve beyond-worst-case performance? We study this online algorithms with a sample (OAS) model. We show a tight $O\left(\log (1/p) \cdot \log m + \log n\right)$-competitive algorithm for...

A. Hebbar, Ravi Kumar, Roie Levin et al. · 0 citations

Preprint Aug 2026

Stochastic Gradient Meets Randomized Rounding: New Algorithms for Node-Weighted Steiner Problems

A new $O(\log n)$ approximation algorithm for Node Weighted Steiner Tree and Node Weighted Steiner Forest that matches the bounds of Klein&Ravi, but has the advantage that they work in the online setting when the terminal pairs are revealed in random order.

Joseph Koutsoutis, Jessica Lerner, Roie Levin et al. · 0 citations