Keyphrases
- approximation algorithms
- precedence constraints
- lower bound
- np hard
- special case
- worst case
- vertex cover
- bin packing
- facility location problem
- open shop
- minimum cost
- set cover
- exact algorithms
- primal dual
- network design problem
- knapsack problem
- randomized algorithms
- approximation schemes
- upper bound
- packing problem
- np hardness
- single machine scheduling problem
- approximation ratio
- learning algorithm
- constant factor
- approximation guarantees
- integrality gap
- constant factor approximation
- branch and bound algorithm
- greedy algorithm
- scheduling problem
- computational complexity
- objective function