Squared edge bound for tours in the unit square
ID: squared-edge-bound-for-tours-in-the-unit-square
Every finite point set in the unit square admits a cyclic visiting order with . Split the square into two right triangles, apply the quadratic path bound in a right triangle, and remove auxiliary corners using the law of cosines. The Cauchy-Schwarz inequality then gives . The tour minimizing ordinary length need not minimize the sum of squared lengths.
New to topics? Read the docs here!