文章基本信息

标题：Approximating Optimal Transport With Linear Programs
本地全文：下载
作者：Kent Quanrud
期刊名称：OASIcs : OpenAccess Series in Informatics
电子版ISSN：2190-6807
出版年度：2018
卷号：69
页码：1-9
DOI：10.4230/OASIcs.SOSA.2019.6
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：optimal transport; fast approximations; linear programming