012

Back to problem list

Excerpted from notes written on 2017-07-18

Given \(n\) points on each of two parallel planes, you are given a task to draw \(n\) line segments by matching each point on the lines in one-to-one correspondence. Find a method to minimize the total length of these \(n\) line segments.