np hard: more coping
integer programming
solve LP relaxation
perfect graphs
set cover
greedy
tsp
ptas
0-1 knapsack
fptas