Raghvendra, Sharath

13 publications

ICLR 2026 A Scalable Constant-Factor Approximation Algorithm for $W_p$ Optimal Transport Pankaj K Agarwal, Oliver Chubet, Sharath Raghvendra, Keegan Yao

ICLR 2026 Efficient Algorithms for Incremental Metric Bipartite Matching Ritesh Seth, Mrinal Garg, Sujoy Bhore, Sharath Raghvendra, Syamantak Das

NeurIPS 2025 Efficient Algorithms for Robust and Partial Semi-Discrete Optimal Transport Pankaj K Agarwal, Sharath Raghvendra, Pouyan Shirzadian, Keegan Yao

ICML 2025 Scalable Approximation Algorithms for $p$-Wasserstein Distance and Its Variants Nathaniel Lahn, Sharath Raghvendra, Emma Saarinen, Pouyan Shirzadian

NeurIPS 2024 A Combinatorial Algorithm for the Semi-Discrete Optimal Transport Problem Pankaj K. Agarwal, Sharath Raghvendra, Pouyan Shirzadian, Keegan Yao

ICML 2024 A New Robust Partial P-Wasserstein-Based Metric for Comparing Distributions Sharath Raghvendra, Pouyan Shirzadian, Kaiyi Zhang

NeurIPS 2023 A Combinatorial Algorithm for Approximating the Optimal Transport in the Parallel and MPC Settings Nathaniel Lahn, Sharath Raghvendra, Kaiyi Zhang

ICLR 2023 A Higher Precision Algorithm for Computing the $1$-Wasserstein Distance Pankaj K Agarwal, Sharath Raghvendra, Pouyan Shirzadian, Rachita Sowle

NeurIPS 2023 A Robust Exact Algorithm for the Euclidean Bipartite Matching Problem Akshaykumar Gattani, Sharath Raghvendra, Pouyan Shirzadian

ICLR 2023 Computing All Optimal Partial Transports Abhijeet Phatak, Sharath Raghvendra, Chittaranjan Tripathy, Kaiyi Zhang

NeurIPSW 2023 Fast and Accurate Cost-Scaling Algorithm for the Semi-Discrete Optimal Transport Pankaj K Agarwal, Sharath Raghvendra, Pouyan Shirzadian, Keegan Yao

NeurIPS 2021 A Faster Maximum Cardinality Matching Algorithm with Applications in Machine Learning Nathaniel Lahn, Sharath Raghvendra, Jiacheng Ye

NeurIPS 2019 A Graph Theoretic Additive Approximation of Optimal Transport Nathaniel Lahn, Deepika Mulchandani, Sharath Raghvendra