高级算法 (Fall 2025) / Course materials: Difference between revisions

From TCS Wiki
Jump to navigation Jump to search
VisualWikitext
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..."
 
(No difference)

Latest revision as of 06:33, 23 August 2025

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.
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=高级算法_(Fall_2025)_/_Course_materials&oldid=13240"