Minimum sum of distances.

Revision en1, by Confused101, 2016-11-25 16:46:57

Given N points in one set(S1) and M points in another set(S2), Choose some edges between points from Set S1 to set S2 such that sum of edges(distances) is minimum and every vertex is chosen atleast once.

Can someone help me solving this problem. Thanks!

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English Confused101 2016-11-25 16:46:57 282 Initial revision (published)