An improved -approximation algorithm for geometric bipartite matching

DOI10.4230/LIPICS.SWAT.2022.6MaRDI QIDQ6544063zbMATH OpenFDO

Authors Pankaj K. Agarwal, Sharath Raghvendra, Pouyan Shirzadian, Rachita Sowle

Publication date 27 May 2024

Full work available at URL https://doi.org/10.4230/LIPICS.SWAT.2022.6

zbMATH Keywords

approximation algorithmseuclidean bipartite matchingprimal dual method

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(1)

• Fine-grained complexity of Earth mover's distance under translation

This page was built for publication: An improved \(\varepsilon\)-approximation algorithm for geometric bipartite matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6544063)