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)
Recommendations
- Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- scientific article; zbMATH DE number 3996906
- A robust model for finding optimal evolutionary tree
- scientific article; zbMATH DE number 3982317
Cites work
- A robust model for finding optimal evolutionary tree
- Aggregating inconsistent information: ranking and clustering
- Algorithms - ESA 2003
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Cluster graph modification problems
- Clustering with qualitative information
- Correlation clustering
- Correlation clustering in general weighted graphs
- Correlation clustering with partial information
- Correlation clustering, maximizing agreements via semidefinite programming
- Deterministic pivoting algorithms for constrained ranking and clustering problems
- Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
- Fitting Tree Metrics: Hierarchical Clustering and Phylogeny
- Fitting distances by tree metrics with increment error
- NP-hard problems in hierarchical-tree clustering
- ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS
- On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics)
- On the hardness of approximating Multicut and Sparsest-Cut
- The Complexity of Multiterminal Cuts
- The complexity of ultrametric partitions on graphs
Cited in
(6)- scientific article; zbMATH DE number 3996906 (Why is no real title available?)
- 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)
