Fitting metrics and ultrametrics with minimum disagreements
From MaRDI portal
Publication:6670352
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Metric embeddings as related to computational problems and algorithms (68R12)
Recommendations
Cites work
- scientific article; zbMATH DE number 5485536 (Why is no real title available?)
- scientific article; zbMATH DE number 5485581 (Why is no real title available?)
- Aggregating inconsistent information: ranking and clustering
- Analysis of Boolean Functions
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
- Approximate hierarchical clustering via sparsest cut and spreading metrics
- Approximating maximum subgraphs without short cycles
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Characterization, stability and convergence of hierarchical clustering methods
- Circumventing \(d\)-to-\(1\) for approximation resistance of satisfiable predicates strictly containing parity of width at least four
- Clustering with qualitative information
- Fitting Tree Metrics: Hierarchical Clustering and Phylogeny
- Gaussian bounds for noise correlation of functions
- Hardness of Graph Pricing Through Generalized Max-Dicut
- Hierarchical clustering better than average-linkage
- Hierarchical clustering. Objective functions and algorithms
- Improved hardness for cut, interdiction, and firefighter problems
- Length-bounded cuts and flows
- Metric embeddings with outliers
- Metric violation distance: hardness and approximation
- New results on optimizing rooted triplets consistency
- On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics)
- On the hardness of approximating Multicut and Sparsest-Cut
- On the power of unique 2-prover 1-round games
- On weighted vs unweighted versions of combinatorial optimization problems
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
- Packing directed circuits fractionally
- Subcubic equivalences between path, matrix, and triangle problems
- The Metric Nearness Problem
This page was built for publication: Fitting metrics and ultrametrics with minimum disagreements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6670352)
