A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem.
Chandra ChekuriSanjeev KhannaJoseph NaorLeonid ZosinPublished in: SIAM J. Discret. Math. (2004)
Keyphrases
- approximation algorithms
- linear programming
- np hard
- quadratic programming
- quadratic program
- primal dual
- linear program
- special case
- worst case
- valid inequalities
- vertex cover
- minimum cost
- optimal solution
- lp relaxation
- feasible solution
- linear programming relaxation
- active learning
- mathematical programming
- facility location problem
- set cover
- np hardness
- network design problem
- approximation ratio
- exact algorithms
- image segmentation
- branch and bound algorithm
- integer programming
- network flow
- randomized algorithms
- open shop
- integer program
- mixed integer
- scheduling problem
- dynamic programming
- lower bound
- precedence constraints
- objective function
- undirected graph
- semi supervised
- approximation guarantees
- approximation schemes