Keyphrases
- approximation algorithms
- scheduling problem
- np hard
- precedence constraints
- special case
- vertex cover
- open shop
- minimum cost
- single machine
- worst case
- job shop
- tabu search
- flowshop
- approximation ratio
- job shop scheduling
- facility location problem
- set cover
- randomized algorithms
- np complete
- linear programming
- approximation schemes
- network design problem
- optimal solution
- strongly np hard
- disjoint paths
- lower bound
- job shop scheduling problem
- parallel machines
- integer programming
- np hardness
- constant factor
- processing times
- knapsack problem
- constant factor approximation
- setup times
- greedy heuristic
- polynomial time approximation
- combinatorial auctions
- constraint satisfaction problems