Approximation Algorithms for Network Connectivity

Herein we discuss previous work on the Euclidean Connectivity Problem with the objective of minimizing maximum movement. We provide new algorithms which both in approximation factor and empirically outperform the state-of-the-art.