A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem
From MaRDI portal
(Redirected from Publication:5317574)
Recommendations
- Approximation algorithms for the metric labeling problem via a new linear programming formulation
- Approximation algorithms for the 0-extension problem
- A constant factor approximation algorithm for a class of classification problems
- A greedy approximation algorithm for the uniform metric labeling problem analyzed by a primal-dual technique
- Approximation algorithms for classification problems with pairwise relationships, metric labeling and Markov random fields
Cited in
(25)- Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems
- Shape-based object detection via boundary structure segmentation
- GRMA: generalized range move algorithms for the efficient optimization of MRFs
- On Lipschitz extension from finite subsets
- Approximation algorithms for the metric labeling problem via a new linear programming formulation
- Metric clustering via consistent labeling
- Rounding-based moves for semi-metric labeling
- Sherali-Adams relaxations for valued CSPs
- Approximation algorithms for classification problems with pairwise relationships, metric labeling and Markov random fields
- A greedy approximation algorithm for the uniform metric labeling problem analyzed by a primal-dual technique
- Parallel Imaging Problem
- Simplex partitioning via exponential clocks and the multiway-cut problem
- Train and test tightness of LP relaxations in structured prediction
- Hinge-loss Markov random fields and probabilistic soft logic
- Image labeling based on graphical models using Wasserstein messages and geometric assignment
- Simplex transformations and the multiway cut problem
- Retracting Graphs to Cycles
- Solving LP relaxations of some NP-hard problems is as hard as solving any linear program
- The power of linear programming for general-valued CSPs
- The power of Sherali-Adams relaxations for general-valued CSPs
- Capacitated metric labeling
- The Hardness of Metric Labeling
- A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: star metric case
- Generalized minimum 0-extension problem and discrete convexity
- Lower bounds on 0-extension with Steiner nodes
This page was built for publication: A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317574)
