# A Graph Theoretic Additive Approximation of Optimal Transport

@inproceedings{Lahn2019AGT, title={A Graph Theoretic Additive Approximation of Optimal Transport}, author={Nathaniel Lahn and Deepika Mulchandani and Sharath Raghvendra}, booktitle={NeurIPS}, year={2019} }

Transportation cost is an attractive similarity measure between probability distributions due to its many useful theoretical properties. However, solving optimal transport exactly can be prohibitively expensive. Therefore, there has been significant effort towards the design of scalable approximation algorithms. Previous combinatorial results [Sharathkumar, Agarwal STOC '12, Agarwal, Sharathkumar STOC '14] have focused primarily on the design of strongly polynomial multiplicative approximation… CONTINUE READING

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

2

Twitter Mentions

#### Citations

##### Publications citing this paper.

SHOWING 1-5 OF 5 CITATIONS

## Revisiting Fixed Support Wasserstein Barycenter: Computational Hardness and Efficient Algorithms

VIEW 4 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## On the Acceleration of the Sinkhorn and Greenkhorn Algorithms for Optimal Transport

VIEW 2 EXCERPTS

CITES METHODS & BACKGROUND

## On the Complexity of Approximating Multimarginal Optimal Transport

VIEW 1 EXCERPT

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 30 REFERENCES

## Preconditioning for the Geometric Transportation Problem

VIEW 2 EXCERPTS

## Approximating optimal transport with linear programs

VIEW 2 EXCERPTS

## Towards Optimal Running Times for Optimal Transport

VIEW 3 EXCERPTS

## Wasserstein discriminant analysis

VIEW 1 EXCERPT