Implementation: Exact algorithms Dynamic programming (DYN) Exhaustive search, i.e. the generation of the entire search tree + some pruning. (EXH) Approximation algorithms Greedy 2-approximation algorithm (GREEDY) FPTAS