先进的算法.pptVIP

Advanced Algrithms 高级算法 华东师范大学计算机科学技术系 石东昱 dyshi@cs.ecnu.edu.cn Review 回顾 Basic data structures 基本数据结构: set, array, matrix, stacks, queues, linked lists, rooted trees, binary search trees, hash tables, graph... Basic analysis of algorithms 基本分析： timespace complexity, big-O,Ω,Θ, PNP class… Techniques 算法技术： divideconquer分治法, greedy贪婪法, recursion递归, backtracking回溯, branchbound分支界定, dynamic programming动态规划, linear programming线性规划… Problem solving 问题解决： counting计数, sorting排序, searching搜索, matching匹配, satisfactory可满足性, optimization优化, graph theory图论, network flow网络流 … Motivation 课程主旨 Why advanced algorithm? - polynomial time exact algorithms not known 一些问题可能没有多项式时间的算法 - problems under stringent resource constraints 一些问题的解决可能受到严厉的资源 (计算、存储)限制 Designing efficient algorithms with provable guarantees on their performance 需要设计更有效的算法，具有可证明的对效率的保证 The aim: speed, simplicity and proof 算法的效率、简单化及可验证 Contents 课程内容 Randomized algorithm 随机算法 Probability analysis 概率分析 Approximation algorithm 近似算法 Other topics 其它专题 Text books References 教材及参考书 R. Motwani, P. Raghavan: Randomized Algorithms, Cambridge University Press, 1995. M. Mitzenmacher, E. Upfal: “Probability and Computing: Randomized Algorithms and Probabilistic Analysis, Cambridge University Press, 2005. Vijay V. Vazirani: “Approximate Algorithms”, Springer, 2001 T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein: Introduction to Algorithms, 2nd Edition, MIT Press and McGraw-Hill, 2001 S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani: Algorithms, McGraw-Hill Research readings ACM Transactions on Algorithms (TALG) Journal of the ACM (JACM) Journal of Algorithms Acta Algorithmica Journal of Experimental Algorithmics (JEA) SIAM Journal on Computing Annual ACM Symposium on Theory of Computing (STOC) IEEE Symposium on Foundations of Computer Science (FOCS) ACM-SIAM Symposium on Discrete Algorithms (SODA) Computational Learning Theory (COLT) Requirements 课程要求 Usual performance 平时成绩 (40%