Exercises¶
Exercises with worked solutions, chapter by chapter, with the same groups as the menu. Try each exercise on your own first: the solution opens with a click.
- 1. Principles of approximation algorithms · 5 exercises
Knapsack problems¶
- 2. Approximation algorithms for the knapsack problem · 15 exercises
Packing problems¶
- 3. Approximation algorithms for bin packing · 12 exercises
Coloring problems¶
- 4. Vertex coloring: limits of approximation · 5 exercises
Clique problems¶
- 5. Maximum clique: limits of approximation · 4 exercises
Routing problems¶
- 6. The TSP: the general case and the metric case · 3 exercises
Scheduling problems¶
- 7. Approximation for P||Cmax · 3 exercises