Optimal Embedding Into Star Metrics
Data Structures and Algorithms
2009-05-05 v1
Abstract
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 the distances in the star are at least as large as in X, with minimum dilation. As part of our algorithm, we solve in the same time bound the parametric negative cycle detection problem: given a directed graph with edge weights that are increasing linear functions of a parameter lambda, find the smallest value of lambda such that the graph contains no negative-weight cycles.
Cite
@article{arxiv.0905.0283,
title = {Optimal Embedding Into Star Metrics},
author = {David Eppstein and Kevin A. Wortman},
journal= {arXiv preprint arXiv:0905.0283},
year = {2009}
}
Comments
12 pages, 3 figures