|
1. Introduction.-2. Divide-and-Conquer |
|
|
3. Dynamic Programming and Shortest Path |
|
|
4. Greedy Algorithm and Spanning Tree |
|
|
5. Incremental Method and Maximum Network Flow |
|
|
6. Linear Programming |
|
|
7. Primal-Dual Methods and Minimum Cost Flow |
|
|
8. NP-hard Problems and Approximation Algorithms |
|
|
9. Restriction and Steiner Tree |
|
|
10. Greedy Approximation and Submodular Optimization |
|
|
11. Relaxation and Rounding. 12. Nonsubmodular Optimization |
|
|
Bibliography |
|
|
1. Introduction.-2. Divide-and-Conquer |
|
|
3. Dynamic Programming and Shortest Path |
|
|
4. Greedy Algorithm and Spanning Tree |
|