Approximation algorithms for the metric labeling problem via a new linear programming formulation.
Chandra ChekuriSanjeev KhannaJoseph NaorLeonid ZosinPublished in: SODA (2001)
Keyphrases
- approximation algorithms
- linear programming
- np hard
- quadratic programming
- primal dual
- quadratic program
- special case
- lp relaxation
- linear program
- valid inequalities
- minimum cost
- worst case
- vertex cover
- linear programming relaxation
- network design problem
- optimal solution
- facility location problem
- feasible solution
- set cover
- approximation ratio
- image segmentation
- lower bound
- branch and bound algorithm
- approximation schemes
- integer programming
- exact algorithms
- open shop
- column generation
- active learning
- dynamic programming
- scheduling problem
- integer program
- network flow
- knapsack problem
- mixed integer
- randomized algorithms
- objective function
- lagrangian relaxation
- mathematical programming
- np hardness
- precedence constraints
- constant factor
- combinatorial auctions
- constraint satisfaction problems
- disjoint paths
- constant factor approximation