Finding the closest ultrametric
DOI10.1016/J.DAM.2014.07.023zbMATH Open1303.05046OpenAlexW2142162160MaRDI QIDQ476304FDOQ476304
Authors: J. Herrera, Sumit K. Garg 
Publication date: 28 November 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.07.023
Recommendations
- Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Publication:4723059
- A robust model for finding optimal evolutionary tree
- scientific article; zbMATH DE number 3982317
Problems related to evolution (92D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Distance in graphs (05C12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Clustering with qualitative information
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Aggregating inconsistent information: ranking and clustering
- Correlation clustering
- A robust model for finding optimal evolutionary tree
- On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics)
- The Complexity of Multiterminal Cuts
- On the hardness of approximating Multicut and Sparsest-Cut
- The complexity of ultrametric partitions on graphs
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
- Correlation clustering in general weighted graphs
- Cluster graph modification problems
- Deterministic pivoting algorithms for constrained ranking and clustering problems
- ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS
- NP-hard problems in hierarchical-tree clustering
- Correlation clustering, maximizing agreements via semidefinite programming
- Algorithms - ESA 2003
- Correlation clustering with partial information
- Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
- Fitting distances by tree metrics with increment error
- Fitting Tree Metrics: Hierarchical Clustering and Phylogeny
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
Cited In (6)
- Title not available (Why is that?)
- Metric violation distance: hardness and approximation
- Ultrametric fitting by gradient descent *
- Fitting metrics and ultrametrics with minimum disagreements
- Ultrametricity of dissimilarity spaces and its significance for data mining
- Combining sub(up)-approximations of different type to improve a solution
This page was built for publication: Finding the closest ultrametric
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476304)
