A Near-linear Time ε-Approximation Algorithm for Geometric Bipartite Matching
DOI10.1145/3393694zbMath1491.68270OpenAlexW3037637792MaRDI QIDQ5133973
Sharath Raghvendra, Pankaj K. Agarwal
Publication date: 11 November 2020
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.406.7261
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25) Randomized algorithms (68W20)
This page was built for publication: A Near-linear Time ε-Approximation Algorithm for Geometric Bipartite Matching
