Approximating optimal transport with linear programs
Data Structures and Algorithms
2018-10-23 v2
Abstract
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.
Cite
@article{arxiv.1810.05957,
title = {Approximating optimal transport with linear programs},
author = {Kent Quanrud},
journal= {arXiv preprint arXiv:1810.05957},
year = {2018}
}
Comments
To appear in SOSA 2019