The Metric Nearness Problem
From MaRDI portal
all pairs shortest pathsdistance matrixmatrix nearness problemsmetricmetric nearnesstriangle inequality
Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Metric spaces, metrizability (54E35) Complexity and performance of numerical algorithms (65Y20) Large-scale problems in mathematical programming (90C06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Recommendations
Cited in
(15)- Ground metric learning on graphs
- Metric violation distance: hardness and approximation
- The distance matching problem
- A scheme for constructing algorithms for correcting a local perturbation in a finite semimetric
- Feature discovery in non-metric pairwise data
- scientific article; zbMATH DE number 4135317 (Why is no real title available?)
- Metric violation distance: hardness and approximation
- Metric-Constrained Optimization for Graph Clustering Algorithms
- Indefinite proximity learning: a review
- Learning to match via inverse optimal transport
- A dual basis approach to multidimensional scaling
- Fitting metrics and ultrametrics with minimum disagreements
- Lowest probability mass neighbour algorithms: relaxing the metric constraint in distance-based neighbourhood algorithms
- An efficient CGA\_ADMM for the metric nearness problem
- An efficient algorithm for the _p norm based metric nearness problem
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)