1 citations · 4 across the 9 of their papers we have counts for
1 paper · 1 filter
David Eppstein, Kevin A. Wortman
We present an O(n^3 log^2 n)-time algorithm for the following problem: given a finite metric space X, create a star-topology network with the points of X as its leaves, such that t…