A Sublinear Approximation Algorithm for Minimum Dilation Trees in the Plane
The first sublinear approximation algorithm for the minimum dilation tree in the Euclidean plane is given, whose approximation ratio is $\tilde{O}(n^{14/15})$ and the algorithm runs in polynomial time.
S. de Berg, Jacobus Conradi, Peter Kramer et al.
· 0 citations