mlsanityData to 14 Oct 2026

Approximating optimal transport with linear programs

arXiv 1810.05957 ↗First posted 14 Oct 2018cs.DScited by 10

Not on the map. Why?

Abstract (arXiv)

In the regime of bounded transportation costs, additive approximations for the optimal transport problem are reduced (rather simply) to relative approximations for positive linear programs, resulting in faster additive approximation algorithms for optimal transport.

Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). First posted on arXiv 14 Oct 2018.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 2; 2022: 3; 2023: 2; 2024: 1; 2025: 2.

10 papers.

  1. 2021Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical Solutioncited by 13
  2. 2023Improved Rate of First Order Algorithms for Entropic Optimal Transportcited by 7
  3. 2022An Accelerated Stochastic Variance-Reduced Algorithm for Entropic Wasserstein Barycenterscited by 6
  4. 2025A Survey on Algorithmic Developments in Optimal Transport Problem with Applicationscited by 4
  5. 2022Discrete Optimal Transport with Independent Marginals is #P-Hardcited by 3
  6. 2023Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methodscited by 2
  7. 2024Graph Cuts with Arbitrary Size Constraints Through Optimal Transportcited by 1
  8. 2021Efficient Optimal Transport Algorithm by Accelerated Gradient descentcited by 0
  9. 2022A machine learning based algorithm selection method to solve the minimum cost flow problemcited by 0
  10. 2025Feature Shift Localization Networkcited by 0