Advanced Algorithms.

1. NPC problems list

2. 0-1 integer problem

3. Branch and Bound for Vertex Cover I

4. Use ILP solve Vertex Cover problem

5. Marriage problem

6. Assignment problem

7. Use ILP solve Set Cover problem

8. Use ILP solve assignment problem

9. Branch and Bound for Vertex Cover II

10. TSP

11. Kernelization for Vertex Cover

12. Solve TSP by MST

13. Solve Vertex Cover by Maximum Matching

14. EPTAS, FPTAS, PTAS

15. PTAS of Greedy Algorithm on Knapsack

16. Path width solve Minimum Vertex Cover

17. Treewidth solve Minimum Vertex Cover

18. Dynamic programming for Knapsack

19. Bin Packing problem