The Metric Nearness Problem
From MaRDI portal
Publication:3609032
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)
Recommendations
Cited in
(13)- A dual basis approach to multidimensional scaling
- The distance matching problem
- Ground metric learning on graphs
- Learning to match via inverse optimal transport
- Metric violation distance: hardness and approximation
- Metric violation distance: hardness and approximation
- scientific article; zbMATH DE number 4135317 (Why is no real title available?)
- Lowest probability mass neighbour algorithms: relaxing the metric constraint in distance-based neighbourhood algorithms
- Feature discovery in non-metric pairwise data
- A scheme for constructing algorithms for correcting a local perturbation in a finite semimetric
- Indefinite proximity learning: a review
- Metric-Constrained Optimization for Graph Clustering Algorithms
- Fitting metrics and ultrametrics with minimum disagreements
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)