What is an algorithm for enclosing 2k of n points in two disjoint rectangles (k points in each) such that their sum of their perimeters is minimized?
SupportExpert
What is an algorithm for enclosing 2k of n points in two disjoint rectangles (k points in each) such that their sum of their perimeters is minimized?
Share