Deterministic, near-linear 𝜀 -approximation algorithm for geometric bipartite matching

DOI10.1145/3519935.3519977arXiv2204.03875MaRDI QIDQ6083558

Sharath Raghvendra, Pankaj K. Agarwal, Allen Xiao, Hsien-Chih Chang

Publication date: 8 December 2023

Published in: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.03875

zbMATH Keywords

matchingcompressionregularizeraugmenting pathtree cover

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: Deterministic, near-linear 𝜀 -approximation algorithm for geometric bipartite matching