Faster algorithms for the geometric transportation problem
From MaRDI portal
Publication:4580079
DOI10.4230/LIPICS.SOCG.2017.7zbMATH Open1432.68481arXiv1903.08263MaRDI QIDQ4580079FDOQ4580079
Authors: Kyle Fox, Debmalya Panigrahi, Allen Xiao, Pankaj K. Agarwal, Kasturi Varadarajan 
Publication date: 13 August 2018
Full work available at URL: https://arxiv.org/abs/1903.08263
Recommendations
Randomized algorithms (68W20) Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cited In (20)
- A near-linear time approximation scheme for geometric transportation with arbitrary supplies and spread
- Title not available (Why is that?)
- Rényi 100, quantitative and qualitative (in)dependence
- Title not available (Why is that?)
- Title not available (Why is that?)
- A data-dependent approach for high-dimensional (robust) Wasserstein alignment
- Title not available (Why is that?)
- Using geometry to solve the transportation problem in the plane
- Algorithms for the transportation problem in geometric settings
- Impossibility of sketching of the 3D transportation metric with quadratic cost
- Fast Algorithms for Geometric Traveling Salesman Problems
- Preconditioning for the geometric transportation problem
- Fast Heuristics for Large Geometric Traveling Salesman Problems
- Geometric median in nearly linear time
- A near-linear time approximation scheme for geometric transportation with arbitrary supplies and spread
- A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs
- Light Euclidean Spanners with Steiner Points
- On geometric prototype and applications
- Parallel algorithms for geometric graph problems
- Preconditioning for the Geometric Transportation Problem
This page was built for publication: Faster algorithms for the geometric transportation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580079)
