A near-linear constant-factor approximation for euclidean bipartite matching?

DOI10.1145/997817.997856zbMath1374.68628OpenAlexW2110940003MaRDI QIDQ5361677

Kasturi R. Varadarajan, Pankaj K. Agarwal

Publication date: 29 September 2017

Published in: Proceedings of the twentieth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/997817.997856

zbMATH Keywords

combinatorial optimizationmatchingapproximation algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (4)

On Geometric Prototype and Applications ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: A near-linear constant-factor approximation for euclidean bipartite matching?