Improving the Stretch Factor of a Geometric Network by Edge Augmentation
Mohammad Farshi, Panos Giannopoulos, Joachim Gudmundsson · SIAM Journal on Computing · 2008
Given a Euclidean graph G in $\mathbb{R}^d$ with n vertices and m edges, we consider the problem of adding an edge to G such that the stretch factor of the resulting graph is minimized. Currently, the fastest algorithm for computing the stretch factor of a graph with positive edge weights runs in $\cal{O}$$(nm+n^2 \log n)$ time, resulting in a trivial $\cal{O}$$(n^3m+n^4 \log n)$-time algorithm for computing the optimal edge. First, we show that a simple modification yields the optimal solution in $\cal{O}$$(n^4)$ time using $\cal{O}$$(n^2)$ space. To reduce the running time we consider several approximation algorithms.