February 27, 2024 (v1)
Publication
In the minimum-weight many-to-many point matching problem, we are given a set R of red points and a set B of blue points in the plane, of total size N, and we want to pair up each point in R to one or more points in B and vice versa so that the sum of distances between the paired points is minimized. This problem can be solved in O(N3) time by...
Uploaded on: March 3, 2024