Algorithmic Problems
by Terry Tam
1. Traveling Salesman Problem (TSP)
2. Hamilton Cycle
3. Subset Sum
3.1. Partition
4. n-Vertex Coloring
5. Independent Set
5.1. n-Independent Set
5.2. Max-Independent Set
6. Vertex Cover
6.1. n-Vertex Cover
6.2. Min-Vertex Cover
6.3. Min-Vertex Cover (bipartite graph)
7. Clique
7.1. n-Clique
7.2. Max-Clique
8. Decision Problem
9. Optimization Problem
10. Knapsack
10.1. 0-1 Knapsack
10.2. Fractional Knapsack
11. 2-SAT
12. Matrix Inversion
13. Matrix Multiplication
14. Convex Hull
15. Sorting
16. 3-Partition
17. 3-SAT
18. P
19. NP-hard
20. NP
21. NP-complete
21.1. Strongly NP-complete
21.2. Weakly NP-complete