Preconditioning for the Geometric Transportation Problem

DOI10.4230/LIPIcs.SoCG.2019.15OpenAlexW3092889289MaRDI QIDQ5088942

Aleksandar Nikolov, Dmitry Paramonov, Andrey Boris Khesin

Publication date: 18 July 2022

Full work available at URL: https://doi.org/10.4230/LIPIcs.SoCG.2019.15

zbMATH Keywords

minimum cost flowtransportation problemEarth mover distance

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal transportation and applications. Lectures given at the C. I. M. E. summer school, Martina Franca, Italy, September 2--8, 2001
• The earth mover's distance as a metric for image retrieval
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Similarity estimation techniques from rounding algorithms
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Generalized Preconditioning and Undirected Minimum-Cost Flow
• Approximation algorithms for bipartite matching with metric and geometric costs
• Parallel algorithms for geometric graph problems
• A near-linear time ε-approximation algorithm for geometric bipartite matching

This page was built for publication: Preconditioning for the Geometric Transportation Problem