The Metric Nearness Problem
DOI10.1137/060653391zbMATH Open1172.05018OpenAlexW1974906551WikidataQ59750762 ScholiaQ59750762MaRDI QIDQ3609032FDOQ3609032
Authors: Justin Brickell, Inderjit S. Dhillon, Suvrit Sra, Joel A. Tropp 
Publication date: 6 March 2009
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/51037d62a6180ee29e660eec9ea213ee85e05943
Recommendations
distance matrixmetrictriangle inequalityall pairs shortest pathsmatrix nearness problemsmetric nearness
Complexity and performance of numerical algorithms (65Y20) Large-scale problems in mathematical programming (90C06) Graph algorithms (graph-theoretic aspects) (05C85) Distance in graphs (05C12) Metric spaces, metrizability (54E35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cited In (13)
- The distance matching problem
- Title not available (Why is that?)
- Feature discovery in non-metric pairwise data
- Metric violation distance: hardness and approximation
- Metric violation distance: hardness and approximation
- Indefinite proximity learning: a review
- Learning to match via inverse optimal transport
- A dual basis approach to multidimensional scaling
- Ground metric learning on graphs
- A scheme for constructing algorithms for correcting a local perturbation in a finite semimetric
- Fitting metrics and ultrametrics with minimum disagreements
- Metric-Constrained Optimization for Graph Clustering Algorithms
- Lowest probability mass neighbour algorithms: relaxing the metric constraint in distance-based neighbourhood algorithms
This page was built for publication: The Metric Nearness Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3609032)
