We study augmenting a plane Euclidean network with a segment, called shortcut, to minimize the largest distance between ...