LN9 :
Approximation
Algorithms: k-Cluster and 0/1 Knapsack Problems.
LN10 :
Approximation Schemes for NP-hard Geometric Optimization Problems: A
survey by Sanjeev Arora.
See also: (Part I), (
Part II) The Euclidean Traveling Salesman Problem.
[Notes by Michel X. Goemans, MIT].