Pages that link to "Item:Q2768280"

The following pages link to Approximation algorithms for the metric labeling problem via a new linear programming formulation (Q2768280):

Displaying 9 items.

• An explicit bound on the transportation cost distance (Q380692) (← links)
• Geometric rounding: A dependent randomized rounding scheme (Q411220) (← links)
• Nonembeddability theorems via Fourier analysis (Q2491108) (← links)
• Approximation algorithms for the 0-extension problem (Q2768266) (← links)
• Metric clustering via consistent labeling (Q3002830) (← links)
• A greedy approximation algorithm for the uniform metric labeling problem analyzed by a primal-dual technique (Q3507758) (← links)
• Efficient Relaxations for Dense CRFs with Sparse Higher-Order Potentials (Q5236643) (← links)
• A tight bound on approximating arbitrary metrics by tree metrics (Q5917578) (← links)
• Exact algorithms for a discrete metric labeling problem (Q5920404) (← links)