Embedding ultrametrics into low-dimensional spaces

• Authors: Mihai Bǎdoiu;Julia Chuzhoy;Piotr Indyk;Anastasios Sidiropou
• Venue: Proceedings of the twenty-second annual symposium on Computational geometry
• Year: 2006

We study the problem of minimum-distortion embedding of ultrametrics into the plane and higher dimensional spaces. Ultrametrics are a natural class of metrics that frequently occur in applications involving hierarchical clustering. Low-distortion embeddings of ultrametrics into the plane help visualizing complex structures they often represent.Given an ultrametric, a natural question is whether we can efficiently find an optimal-distortion embedding of this ultrametric into the plane, and if not, whether we can design an efficient algorithm that produces embeddings with near-optimal distortion. We show that the problem of finding minimum-distortion embedding of ultrametrics into the plane is NP-hard, and thus approximation algorithms are called for. Given an input ultrametric M, let c denote the minimum distortion achievable by any embedding of M into the plane. Our main result is a linear-time algorithm that produces an O(c3)-distortion embedding. This result can be generalized to embedding ultrametrics into Rd, for any d≥2, with distortion cO(d), where c is the minimum distortion achievable for embedding the input ultrametric into Rd.Additionally, we show that any ultrametric can be embedded into the plane with distortion O(√n), and in general, into Rd with distortion dO(1) n1/d. Combining the two results together, we obtain an O(n1/3)-approximation algorithm for the problem of minimum-distortion embedding of ultrametrics into the plane.