Minimum Euclidean Matching in 2D
Statement
What is the complexity of computing a minimum-cost Euclidean matching for points in the plane? The cost of a matching is the total length of the edges in the matching.
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.