Martin P. Seybold

Fully Dynamic Euclidean Bi-Chromatic Matching in Sublinear Update Time

We consider the Euclidean bi-chromatic matching problem in the dynamic setting, where the goal is to efficiently process point insertions and deletions while maintaining a high-quality solution. Computing the minimum cost bi-chromatic matching is one of the core problems in geometric optimization th…