Preprint
Sep 2026
A Robustified Greedy Algorithm for Online Transportation with Improved Competitive Guarantees
We study the \emph{online transportation problem}, in which $n$ requests arriving sequentially in a metric space must be irrevocably assigned to $k$ capacitated facilities. Beyond classical logistics applications, this problem models resource-allocation tasks arising in machine learning, including online facility assig...
Ritesh Seth, Syamantak Das, S. Raghvendra
· 0 citations