I am thinkin like.. make a completely connected graph.. (connect all 2N points to each other)... then delete connections starting with ones with max distance between them... this should give the desired result
On Feb 11, 11:20 pm, GentLeBoY <vikrantsing...@gmail.com> wrote: > given 2N points in a plane. Pair up to obtain N distinct pairs such > that total sum of paired distances is minimum. > N can be atmost 50. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
