l_-approximation via subdominants.
From MaRDI portal
Recommendations
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Combining sub(up)-approximations of different type to improve a solution
- scientific article; zbMATH DE number 3996906
- L-infinity optimization to linear spaces and phylogenetic trees
- scientific article; zbMATH DE number 3982317
Cites work
- A note on the metric properties of trees
- A robust model for finding optimal evolutionary tree
- An algorithm for tree-realizability of distance matrices∗
- Computational complexity of inferring phylogenies from dissimilarity matrices
- Free trees and bidirectional trees as representations of psychological distance
- scientific article; zbMATH DE number 3952572 (Why is no real title available?)
- scientific article; zbMATH DE number 3982317 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 53860 (Why is no real title available?)
- scientific article; zbMATH DE number 193111 (Why is no real title available?)
- scientific article; zbMATH DE number 1124622 (Why is no real title available?)
- scientific article; zbMATH DE number 3448387 (Why is no real title available?)
- scientific article; zbMATH DE number 802809 (Why is no real title available?)
- scientific article; zbMATH DE number 871934 (Why is no real title available?)
- scientific article; zbMATH DE number 3204690 (Why is no real title available?)
- scientific article; zbMATH DE number 3243264 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- scientific article; zbMATH DE number 3390139 (Why is no real title available?)
- Isotone optimization. I
- Minimum spanning trees for tree metrics: Abridgements and adjustments
- NP-hard problems in hierarchical-tree clustering
- Recognition of Tree Metrics
- Spatial, non-spatial and hybrid models for scaling
- Sur les groupes hyperboliques d'après Mikhael Gromov. (On the hyperbolic groups à la M. Gromov)
- Symmetric Matrices Representable by Weighted Trees over a Cancellative Abelian Monoid
- The complexity of ultrametric partitions on graphs
Cited in
(14)- Inferring evolutionary trees with strong combinatorial evidence
- \(\Delta\) additive and \(\Delta\) ultra-additive maps, Gromov's trees, and the Farris transform
- Extreme rays of the ^-nearest ultrametric tropical polytope
- Combinatorial optimisation and hierarchical classifications
- Seriation in the presence of errors: NP-hardness of \(l_{\infty}\)-fitting Robinson structures to dissimilarity matrices
- Combining sub(up)-approximations of different type to improve a solution
- L-infinity optimization to Bergman fans of matroids with an application to phylogenetics
- L-infinity optimization to linear spaces and phylogenetic trees
- Convexity in tree spaces
- Tropical Linear Regression and Mean Payoff Games: Or, How to Measure the Distance to Equilibria
- Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances
- Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs
- Intrinsic interleaving distance for merge trees
- Fitting tree metrics and ultrametrics in data streams
This page was built for publication: \(l_\infty\)-approximation via subdominants.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1599172)