Finding the closest ultrametric
type: Item
instance of: scholarly article
title: Finding the closest ultrametric
zbMATH Open document ID: 1303.05046
author: J. Herrera
author: Sumit K. Garg
published in: Discrete Applied Mathematics
publication date: 2014-11-28T00:00:00Z
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 92D15
zbMATH DE Number: 6375308
zbMATH Keywords: ultrametric
zbMATH Keywords: approximation algorithm
zbMATH Keywords: cluster deletion
zbMATH Keywords: phylogenetic reconstruction
MaRDI profile type: Publication
full work available at URL: j.dam.2014.07.023
OpenAlex ID: W2142162160
cites work: Q2934632
cites work: On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics)
cites work: Fitting Tree Metrics: Hierarchical Clustering and Phylogeny
cites work: Aggregating inconsistent information
cites work: Correlation clustering
cites work: Clustering with qualitative information
cites work: On the hardness of approximating Multicut and Sparsest-Cut
cites work: The Complexity of Multiterminal Cuts
cites work: Correlation clustering in general weighted graphs
cites work: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
cites work: ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS
cites work: Algorithms - ESA 2003
cites work: A robust model for finding optimal evolutionary tree
cites work: Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
cites work: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
cites work: The complexity of ultrametric partitions on graphs
cites work: NP-hard problems in hierarchical-tree clustering
cites work: Fitting distances by tree metrics with increment error
cites work: Cluster graph modification problems
cites work: Q5501301
cites work: Q2934620
cites work: Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
DOI: 10.1016/J.DAM.2014.07.023
description: scientific article; zbMATH DE number 6375308