scientific article; zbMATH DE number 2079348
From MaRDI portal
Publication:4471307
Recommendations
- Approximation algorithms for the 0-extension problem
- Discrete convexity and polynomial solvability in minimum 0-extension problems (extended abstract)
- Approximation Algorithms for the 0-Extension Problem
- On earthmover distance, metric labeling, and 0-extension
- On earthmover distance, metric labeling, and 0-extension
Cited in
(18)- Approximation Algorithms for the 0-Extension Problem
- Parameterized algorithms for zero extension and metric labelling problems
- Lipschitz extension theorems with explicit constants
- Making doubling metrics geodesic
- Graph Clustering using Effective Resistance
- Simplex transformations and the multiway cut problem
- Simplex partitioning via exponential clocks and the multiway-cut problem
- Absolute Lipschitz extendability
- Metric extension operators, vertex sparsifiers and Lipschitz extendability
- A tight bound on approximating arbitrary metrics by tree metrics
- On Lipschitz extension from finite subsets
- Steiner point removal with distortion \(O(\log k)\) using the \texttt{Relaxed-Voronoi} algorithm
- Extending Lipschitz functions via random metric partitions
- Approximation algorithms for the 0-extension problem
- Advances in metric embedding theory
- A simple algorithm for the multiway cut problem
- Retracting Graphs to Cycles
- Discrete convexity and polynomial solvability in minimum 0-extension problems (extended abstract)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471307)
