On earthmover distance, metric labeling, and 0-extension
From MaRDI portal
Publication:3558006
Recommendations
Cited in
(14)- Retracting Graphs to Cycles
- Parameterized algorithms for zero extension and metric labelling problems
- On Lipschitz extension from finite subsets
- Approximate classification via earthmover metrics
- Simplex partitioning via exponential clocks and the multiway-cut problem
- Approximation Algorithms for the 0-Extension Problem
- Minimum 0-extension problems on directed metrics
- scientific article; zbMATH DE number 2079348 (Why is no real title available?)
- Weakly Modular Graphs and Nonpositive Curvature
- On earthmover distance, metric labeling, and 0-extension
- Simplex transformations and the multiway cut problem
- Hardness of approximation for crossing number
- Isometric structure of transportation cost spaces on finite metric spaces
- Approximation algorithms for the 0-extension problem
This page was built for publication: On earthmover distance, metric labeling, and 0-extension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3558006)