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

From TCS Wiki
Jump to navigation Jump to search
VisualWikitext
Line 19: Line 19:
:'''''Probability and Computing: Randomized Algorithms and Probabilistic Analysis'''''.  
:'''''Probability and Computing: Randomized Algorithms and Probabilistic Analysis'''''.  
:Cambridge University Press, 2005.
:Cambridge University Press, 2005.
|-
|[[File:The_Probabilistic_Method.jpg|border|100px]]||
:Noga Alon and Joel Spencer.
:'''''The Probabilistic Method''''', 4th edition.
:Wiley, 2016.
|-
|-
|[[File:Design_of_Approximation_Algorithms.png‎|border|100px]]||
|[[File:Design_of_Approximation_Algorithms.png‎|border|100px]]||
Line 24: Line 29:
:'''''The Design of Approximation Algorithms'''''.  
:'''''The Design of Approximation Algorithms'''''.  
:Cambridge University Press, 2011.
:Cambridge University Press, 2011.
|-
|[[File:Algo.jpg‎|border|100px]]
|width="100%"|
:Sanjoy Dasgupta, Christos Papadimitriou and Umesh Vazirani.
:'''''Algorithms'''''.
:McGraw-Hill, 2006.
|-
|[[File:The_Probabilistic_Method.jpg|border|100px]]||
:Noga Alon and Joel Spencer.
:'''''The Probabilistic Method''''', 4th edition.
:Wiley, 2016.
|-
|-
|[[File:Combinatorial_Optimization.webp|border|100px]]||
|[[File:Combinatorial_Optimization.webp|border|100px]]||
Line 50: Line 44:
:'''''Eigenvalues and Polynomials'''''.
:'''''Eigenvalues and Polynomials'''''.
:https://cs.uwaterloo.ca/~lapchi/cs860/notes/eigenpoly.pdf
:https://cs.uwaterloo.ca/~lapchi/cs860/notes/eigenpoly.pdf
|-
|[[File:Algo.jpg‎|border|100px]]
|width="100%"|
:Sanjoy Dasgupta, Christos Papadimitriou and Umesh Vazirani.
:'''''Algorithms'''''.
:McGraw-Hill, 2006.
|-
|-
|}
|}

Revision as of 13:39, 10 September 2023

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: Randomized Algorithms and Probabilistic Analysis.
Cambridge University Press, 2005.
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, 3rd edition.
Springer, 2008.
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_2023)_/_Course_materials&oldid=11610"