,
Petr A. Golovach
,
Yash Hiren More
Creative Commons Attribution 4.0 International license
In the Ultrametric Violation Distance problem, we are given a set of distances between n points, and the goal is to modify the minimum number of distances so that the resulting set forms a valid ultrametric. In other words, the task is to fit an ultrametric to the given data, where the quality of the fit is measured by the 𝓁₀-norm of the error. While variants of this problem under the 𝓁_∞ and 𝓁₁-norms have been well studied, the complexity of Ultrametric Violation Distance under the 𝓁₀-norm remained largely unexplored until recently. This changed with the work of Cohen-Addad, Fan, Lee, and Mesmay [FOCS 2022], who introduced a constant-factor approximation algorithm. Significant further progress on approximation algorithms was made in subsequent work by Charikar and Gao [SODA 2024], and by An, Kao, Lee, and Lee [FOCS 2025]. In this paper, we initiate a systematic study of Ultrametric Violation Distance from the perspectives of kernelization and fixed-parameter tractability (FPT). By the work of Fan, Gilbert, Raichel, Sonthalia, and Van Buskirk [SWAT 2020], the problem is known to be FPT when parameterized by the number of violated distances k. We show that the problem admits a kernel with 𝒪(k²) points. Additionally, we present a single-exponential-time algorithm with running time 9^k ⋅ n^𝒪(1), which is asymptotically tight.
@InProceedings{fomin_et_al:LIPIcs.IPEC.2026.29,
author = {Fomin, Fedor V. and Golovach, Petr A. and More, Yash Hiren},
title = {{Ultrametric Violation Distance: Polynomial Kernel and FPT Algorithm}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {29:1--29:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-456-7},
ISSN = {1868-8969},
year = {2026},
volume = {398},
editor = {Korhonen, Tuukka and Lampis, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2026.29},
URN = {urn:nbn:de:0030-drops-282022},
doi = {10.4230/LIPIcs.IPEC.2026.29},
annote = {Keywords: Ultrametrics, Hierarchical Clustering, Parameterized Complexity, Kernelization, FPT Algorithms}
}