Revision as of 13:41, 10 September 2023

Course textbooks

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

	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.
	Sanjoy Dasgupta, Christos Papadimitriou and Umesh Vazirani. Algorithms. McGraw-Hill, 2006.

@@ Line 39: / Line 39: @@
 :'''''Lx = b: laplacian solvers and their algorithmic applications'''''.
 :Foundations and Trends® in Theoretical Computer Science, 2012.
-|-
-|[[File:Eigenvalues_and_Polynomials.png|border|100px]]||
-:Lap Chi Lau.
-:'''''Eigenvalues and Polynomials'''''.
-:https://cs.uwaterloo.ca/~lapchi/cs860/notes/eigenpoly.pdf
 |-
 |[[File:Algo.jpg‎|border|100px]]