Nathaniel Lahn

According to our database, Nathaniel Lahn authored at least 10 papers between 2018 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Scalable Approximation Algorithms for p-Wasserstein Distance and Its Variants.

Nathaniel Lahn, Sharath Raghvendra, Emma Saarinen, Pouyan Shirzadian

Proceedings of the Forty-second International Conference on Machine Learning, 2025

2023

A Combinatorial Algorithm for Approximating the Optimal Transport in the Parallel and MPC Settings.

Nathaniel Lahn, Sharath Raghvendra, Kaiyi Zhang

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022

A Push-Relabel Based Additive Approximation for Optimal Transport.

Nathaniel Lahn, Sharath Raghvendra, Kaiyi Zhang

CoRR, 2022

2021

An <i>O</i>(<i>n</i>^5/4) Time <i>∊</i>-Approximation Algorithm for RMS Matching in a Plane.

Nathaniel Lahn, Sharath Raghvendra

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

A Faster Maximum Cardinality Matching Algorithm with Applications in Machine Learning.

Nathaniel Lahn, Sharath Raghvendra, Jiacheng Ye

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020

An Õ(n^5/4) Time ε-Approximation Algorithm for RMS Matching in a Plane.

Nathaniel Lahn, Sharath Raghvendra

CoRR, 2020

2019

A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs.

Nathaniel Lahn, Sharath Raghvendra

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

A Graph Theoretic Additive Approximation of Optimal Transport.

Nathaniel Lahn, Deepika Mulchandani, Sharath Raghvendra

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

A Weighted Approach to the Maximum Cardinality Bipartite Matching Problem with Applications in Geometric Settings.

Nathaniel Lahn, Sharath Raghvendra

Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018

A Faster Algorithm for Minimum-Cost Bipartite Perfect Matching in Planar Graphs.

Mudabir Kabir Asathulla, Sanjeev Khanna, Nathaniel Lahn, Sharath Raghvendra

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018