高级算法 (Fall 2024) / Course materials

From TCS Wiki
Revision as of 05:23, 28 August 2024 by Etone (talk | contribs) (Created page with "= Course textbooks = {|border="2" cellspacing="4" cellpadding="3" rules="all" style="margin:1em 1em 1em 0; border:solid 1px #AAAAAA; border-collapse:collapse;empty-cells:show;" |border|100px |width="100%"| :Rajeev Motwani and Prabhakar Raghavan. :'''''Randomized Algorithms'''''. :Cambridge University Press, 1995. |- |border|100px|| : Vijay Vazirani. :'''''Approximation Algorithms'''''. :S...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Course textbooks

Rajeev Motwani and Prabhakar Raghavan.
Randomized Algorithms.
Cambridge University Press, 1995.
Vijay Vazirani.
Approximation Algorithms.
Springer-Verlag, 2001.

References and further readings

Michael Mitzenmacher and Eli Upfal.
Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis, 2nd Edition
Cambridge University Press, 2017.
Noga Alon and Joel Spencer.
The Probabilistic Method, 4th edition.
Wiley, 2016.
David P. Williamson and David Shmoys.
The Design of Approximation Algorithms.
Cambridge University Press, 2011.
Bernhard Korte and Jens Vygen.
Combinatorial Optimization: theory and algorithms, 6th edition.
Springer, 2018.
Nisheeth K. Vishnoi.
Lx = b: laplacian solvers and their algorithmic applications.
Foundations and Trends® in Theoretical Computer Science, 2012.
Lap Chi Lau.
Eigenvalues and Polynomials.
https://cs.uwaterloo.ca/~lapchi/cs860/notes/eigenpoly.pdf
Sanjoy Dasgupta, Christos Papadimitriou and Umesh Vazirani.
Algorithms.
McGraw-Hill, 2006.