Pages that link to "Item:Q5317574"
From MaRDI portal
The following pages link to A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem (Q5317574):
Displaying 16 items.
- Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems (Q1026110) (← links)
- Shape-based object detection via boundary structure segmentation (Q1931604) (← links)
- GRMA: generalized range move algorithms for the efficient optimization of MRFs (Q2193531) (← links)
- On Lipschitz extension from finite subsets (Q2357002) (← links)
- Sherali-Adams Relaxations for Valued CSPs (Q3448860) (← links)
- Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem (Q4577771) (← links)
- (Q4633022) (← links)
- (Q4637032) (← links)
- Image Labeling Based on Graphical Models Using Wasserstein Messages and Geometric Assignment (Q4689763) (← links)
- Simplex Transformations and the Multiway Cut Problem (Q5000653) (← links)
- Retracting Graphs to Cycles (Q5091228) (← links)
- Solving LP Relaxations of Some NP-Hard Problems Is As Hard As Solving Any Linear Program (Q5231683) (← links)
- The Power of Linear Programming for General-Valued CSPs (Q5252658) (← links)
- The Power of Sherali--Adams Relaxations for General-Valued CSPs (Q5348454) (← links)
- A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: star metric case (Q6130232) (← links)
- Generalized minimum 0-extension problem and discrete convexity (Q6665385) (← links)
