Optimization from partial solution: minimize sum of distances between pairs

Question

I have a problem which I like and I love to think about solutions, but I\'m stuck unfortunately. I hope you like it too. The problem states:

I have two lists of 2D point

Answer 1

This is the minimum weight Euclidean bipartite matching problem. There is a O(n^(2+epsilon)) algorithm.