Approximation algorithms for the metric labeling problem via a new linear programming formulation
From MaRDI portal
Publication:2768280
zbMATH Open0989.90104MaRDI QIDQ2768280FDOQ2768280
Authors: Chandra Chekuri, Sanjeev Khanna, Joseph (Seffi) Naor, Leonid Zosin 
Publication date: 24 March 2002
Recommendations
- A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem
- Exact algorithms for a discrete metric labeling problem
- Exact algorithms for a discrete metric labeling problem
- A greedy approximation algorithm for the uniform metric labeling problem analyzed by a primal-dual technique
- Parameterized algorithms for zero extension and metric labelling problems
- Approximation Algorithms for Metric Facility Location Problems
- scientific article; zbMATH DE number 1875437
- Approximating minimum label \(s\)-\(t\) cut via linear programming
- A new approximation algorithm for labeling points with circle pairs
- Approximating the Metric TSP in Linear Time
Cited In (12)
- Nonembeddability theorems via Fourier analysis
- Geometric rounding: A dependent randomized rounding scheme
- A tight bound on approximating arbitrary metrics by tree metrics
- Efficient Relaxations for Dense CRFs with Sparse Higher-Order Potentials
- Parallel Imaging Problem
- A greedy approximation algorithm for the uniform metric labeling problem analyzed by a primal-dual technique
- A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem
- Exact algorithms for a discrete metric labeling problem
- The Hardness of Metric Labeling
- Metric clustering via consistent labeling
- An explicit bound on the transportation cost distance
- Approximation algorithms for the 0-extension problem
This page was built for publication: Approximation algorithms for the metric labeling problem via a new linear programming formulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768280)
