DeepAI AI Chat
Log In Sign Up

Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor

by   Vincent Cohen-Addad, et al.

We consider the numerical taxonomy problem of fitting a positive distance function D:S 2→ℝ_>0 by a tree metric. We want a tree T with positive edge weights and including S among the vertices so that their distances in T match those in D. A nice application is in evolutionary biology where the tree T aims to approximate the branching process leading to the observed distances in D [Cavalli-Sforza and Edwards 1967]. We consider the total error, that is the sum of distance errors over all pairs of points. We present a deterministic polynomial time algorithm minimizing the total error within a constant factor. We can do this both for general trees, and for the special case of ultrametrics with a root having the same distance to all vertices in S. The problems are APX-hard, so a constant factor is the best we can hope for in polynomial time. The best previous approximation factor was O((log n)(loglog n)) by Ailon and Charikar [2005] who wrote "Determining whether an O(1) approximation can be obtained is a fascinating question".


page 1

page 2

page 3

page 4


Further Improvements on Approximating the Uniform Cost-Distance Steiner Tree Problem

In this paper, we consider the Uniform Cost-Distance Steiner Tree Proble...

Approximation Algorithms For The Dispersion Problems in a Metric Space

In this article, we consider the c-dispersion problem in a metric space ...

Approximating optimization problems in graphs with locational uncertainty

Many combinatorial optimization problems can be formulated as the search...

Quasi-universality of Reeb graph distances

We establish bi-Lipschitz bounds certifying quasi-universality (universa...

HyperAid: Denoising in hyperbolic spaces for tree-fitting and hierarchical clustering

The problem of fitting distances by tree-metrics has received significan...

Recognizing k-leaf powers in polynomial time, for constant k

A graph G is a k-leaf power if there exists a tree T whose leaf set is V...

Distances Release with Differential Privacy in Tree and Grid Graph

Data about individuals may contain private and sensitive information. Th...