A $5/2$-Approximation for Weighted Ultrametric Embedding with Outliers

Abstract

Weighted ultrametric embedding with outliers asks for a minimum weight set of points whose deletion makes the remaining metric an ultrametric, equivalently, leaves no triple with a unique largest distance. We give a deterministic $5/2$-approximation using $O(n^5)$ arithmetic and comparison operations, improving the previous factor $3$ for arbitrary nonnegative vertex weights. Approximating the problem within any factor strictly below $2$ is UGC-hard.

arXiv comment11 pages