5.1 一般方法 5.2 多段图问题 5.3 每对结点之间的最短路径 5.4 最优二分检索树

4.1 最优化问题 4.2 背包问题 4.3 带有限期的作业排序 4.5 最小生成树

南京大学：《高级算法 Advanced Algorithms》课程教学资源（课件讲稿）Introduction（Min-Cut and Max-Cut，尹⼀通）

南京大学：《高级算法 Advanced Algorithms》课程教学资源（课件讲稿）Concentration of Measure

南京大学：《高级算法 Advanced Algorithms》课程教学资源（课件讲稿）Balls into Bins

南京大学：《高级算法 Advanced Algorithms》课程教学资源（课件讲稿）Fingerprinting

南京大学：《高级算法 Advanced Algorithms》课程教学资源（课件讲稿）Greedy and Local Search

Fixed -universe successor problem Goal: maintain a dynamic subset s of size n of the universe 0=10, 1,.,u-1 of size u subject to these operations INSERT(X∈U\\S): Add x to s DELETE(X E S): Remove x from S

Computational geometry Algorithms for solving geometric problems in 2D and higher Fundamental objects: o point line segment

Binary-search-tree sort 7∈ b Create an empty Bst for i=i to n do trEe-INSert(,AiD) Perform an inorder tree walk of t Example: