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