Approximation algorithms for the covering-type k-violation linear program.
Yotaro TakazawaShinji MizunoTomonari KitaharaPublished in: Optim. Lett. (2019)
Keyphrases
- approximation algorithms
- linear program
- np hard
- primal dual
- linear programming
- integrality gap
- optimal solution
- semi infinite
- quadratic program
- special case
- worst case
- vertex cover
- scheduling problem
- interior point methods
- minimum cost
- approximate dynamic programming
- np hardness
- column generation
- exact algorithms
- approximation ratio
- objective function
- integer program
- combinatorial auctions
- lower bound
- randomized algorithms
- constant factor
- mixed integer
- network design problem
- integer programming
- simplex algorithm
- linear programming relaxation
- approximation guarantees
- semidefinite programming
- learning algorithm
- feasible solution
- computational complexity
- constant factor approximation