\(l_\infty\)-approximation via subdominants.

DOI10.1006/jmps.1999.1270zbMath1073.91638OpenAlexW1963650295WikidataQ52069709 ScholiaQ52069709MaRDI QIDQ1599172

Bernard Fichet, Victor Chepoi

Publication date: 2000

Published in: Journal of Mathematical Psychology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jmps.1999.1270

Mathematics Subject Classification ID

Approximation by other special function classes (41A30) Numerical integration (65D30) Measurement and performance in psychology (91E45)

Related Items

Extreme rays of the \(\ell^\infty\)-nearest ultrametric tropical polytope ⋮ L-Infinity Optimization to Linear Spaces and Phylogenetic Trees ⋮ Tropical Linear Regression and Mean Payoff Games: Or, How to Measure the Distance to Equilibria ⋮ Convexity in Tree Spaces ⋮ 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 ⋮ Combinatorial optimisation and hierarchical classifications ⋮ \(\Delta\) additive and \(\Delta\) ultra-additive maps, Gromov's trees, and the Farris transform ⋮ L-Infinity Optimization to Bergman Fans of Matroids with an Application to Phylogenetics ⋮ Inferring evolutionary trees with strong combinatorial evidence ⋮ Seriation in the presence of errors: NP-hardness of \(l_{\infty}\)-fitting Robinson structures to dissimilarity matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational complexity of inferring phylogenies from dissimilarity matrices
• The complexity of ultrametric partitions on graphs
• NP-hard problems in hierarchical-tree clustering
• Sur les groupes hyperboliques d'après Mikhael Gromov. (On the hyperbolic groups à la M. Gromov)
• Spatial, non-spatial and hybrid models for scaling
• Free trees and bidirectional trees as representations of psychological distance
• A note on the metric properties of trees
• Isotone optimization. I
• A robust model for finding optimal evolutionary tree
• Minimum spanning trees for tree metrics: Abridgements and adjustments
• An algorithm for tree-realizability of distance matrices^∗
• Recognition of Tree Metrics
• Symmetric Matrices Representable by Weighted Trees over a Cancellative Abelian Monoid