Text book J. Kleinberg and e Tardos, Algorithm design, Addison-Wesley 2005 We will add more material in the handout References T.H. Cormen. C. E LeisersonR.L. rivest. Introduction to Algorithms. The mit press http://theory.ics.mit.edu/clr/ R Sedgewick, Algorithms in C++, Addison-Wesley, 2002 A Levitin, Introduction to the design and analysis of algorithms, Addison-Wesley, 2003 M.R. Garry and D.S. Johnson. Computers and intractability. a guide to the theory of NP-completeness, W.H. Freeman and company, 1979 2021/26 CS4335 Design and Analysis of2021/1/26 CS4335 Design and Analysis of Algorithms /Shuai Cheng Li Page 2 Text Book: • J. Kleinberg and E. Tardos, Algorithm design, Addison-Wesley, 2005. • We will add more material in the handout. References: • T. H. Cormen, C. E. Leiserson, R. L. Rivest, Introduction to Algorithms, The MIT Press. http://theory.lcs.mit.edu/~clr/ • R. Sedgewick, Algorithms in C++, Addison-Wesley, 2002. • A. Levitin, Introduction to the design and analysis of algorithms, Addison-Wesley, 2003. • M.R. Garry and D. S. Johnson, Computers and intractability, a guide to the theory of NP-completeness, W.H. Freeman and company, 1979