Skip to content

Author

S. Raghvendra

2 papers indexed here

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 Aug 2026

Computing All Optimal Partial $p$-Wasserstein Matchings on the Line

An FFT-based data structure for balanced-interval transport queries is provided and an open-source C++ implementation is provided that outperforms the state-of-the-art baseline on a range of synthetic instances and establishes a conditional lower bound for p=\infty.

Sebastian Angrick, Jacobus Conradi, Mónika Csikós et al. · 0 citations
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

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.