scientific article; zbMATH DE number 7053281
From MaRDI portal
Publication:5743402
zbMath1423.90023MaRDI QIDQ5743402
R. Sharathkumar, Pankaj K. Agarwal
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095145
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Transportation, logistics and supply chain management (90B06) Data structures (68P05)
Related Items (11)
Optimally solving a transportation problem using Voronoi diagrams ⋮ FPTAS for minimizing the earth mover's distance under rigid transformations and related problems ⋮ Geometry Helps to Compare Persistence Diagrams ⋮ Reprint of: Optimally solving a transportation problem using Voronoi diagrams ⋮ Topological learning for brain networks ⋮ On Geometric Prototype and Applications ⋮ Preconditioning for the Geometric Transportation Problem ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On universally consistent and fully distribution-free rank tests of vector independence
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamic Euclidean minimum spanning trees and extrema of binary functions
- A data structure for dynamic trees
- Using geometry to solve the transportation problem in the plane
- Geometry Helps in Matching
- Faster Scaling Algorithms for Network Problems
- Sublinear Algorithms in the External Memory Model
- Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
- Efficient Sketches for Earth-Mover Distance, with Applications
- A near-linear constant-factor approximation for euclidean bipartite matching?
- Fully Dynamic Maximal Matching in O (log n) Update Time
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
This page was built for publication:
