12 citations · 29 across the 14 of their papers we have counts for
19 papers
A Robustified Greedy Algorithm for Online Transportation with Improved Competitive Guarantees
Ritesh Seth, Syamantak Das, Sharath Raghvendra
We study the \emph{online transportation problem}, in which requests arriving sequentially in a metric space must be irrevocably assigned to capacitated facilities. Beyond…
Computing All Optimal Partial -Wasserstein Matchings on the Line
Sebastian Angrick, Jacobus Conradi, Mónika Csikós +5
For , the -Wasserstein distance measures the minimum cost of transporting probability mass between distributions, where moving unit mass between two points costs the $p…
Geometric Bipartite Matching Based Exact Algorithms for Server Problems
Sharath Raghvendra, Pouyan Shirzadian, Rachita Sowle
For any given metric space, obtaining an offline optimal solution to the classical -server problem can be reduced to solving a minimum-cost partial bipartite matching between tw…
A New Robust Partial -Wasserstein-Based Metric for Comparing Distributions
Sharath Raghvendra, Pouyan Shirzadian, Kaiyi Zhang
The -Wasserstein distance is sensitive to minor geometric differences between distributions, making it a very powerful dissimilarity metric. However, due to this sensitivity, a…
Fast and Accurate Approximations of the Optimal Transport in Semi-Discrete and Discrete Settings
Pankaj K. Agarwal, Sharath Raghvendra, Pouyan Shirzadian +1
Given a -dimensional continuous (resp. discrete) probability distribution and a discrete distribution , the semi-discrete (resp. discrete) Optimal Transport (OT) problem…
Deterministic, Near-Linear -Approximation Algorithm for Geometric Bipartite Matching
Pankaj K. Agarwal, Hsien-Chih Chang, Sharath Raghvendra +1
Given point sets and in where and have equal size for some constant dimension and a parameter , we present the first determini…