scientific article; zbMATH DE number 2079348

zbMATH Open1094.68701MaRDI QIDQ4471307FDOQ4471307

Authors:

Publication date: 28 July 2004

Title of this publication is not available (Why is that?)

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Cited In (18)

• Retracting Graphs to Cycles
• Parameterized algorithms for zero extension and metric labelling problems
• On Lipschitz extension from finite subsets
• A simple algorithm for the multiway cut problem
• A tight bound on approximating arbitrary metrics by tree metrics
• Simplex partitioning via exponential clocks and the multiway-cut problem
• Extending Lipschitz functions via random metric partitions
• Approximation Algorithms for the 0-Extension Problem
• Graph Clustering using Effective Resistance
• Advances in metric embedding theory
• Making doubling metrics geodesic
• Lipschitz extension theorems with explicit constants
• Steiner point removal with distortion \(O(\log k)\) using the \texttt{Relaxed-Voronoi} algorithm
• Simplex transformations and the multiway cut problem
• Metric extension operators, vertex sparsifiers and Lipschitz extendability
• Absolute Lipschitz extendability
• Discrete convexity and polynomial solvability in minimum 0-extension problems (extended abstract)
• Approximation algorithms for the 0-extension problem

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)