2026-08-10T10:58:21Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:10032 2024-03-06T10:30:32Z ddc:004 open_access

Approximating Optimal Transport With Linear Programs Quanrud, Kent optimal transport fast approximations linear programming 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Kent Quanrud 2019 Is Part Of OASIcs, Volume 69, 2nd Symposium on Simplicity in Algorithms (SOSA 2019) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.SOSA.2019.6 urn:nbn:de:0030-drops-100321 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2019.6 eng https://creativecommons.org/licenses/by/3.0/legalcode