Revision as of 13:27, 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.
	David P. Williamson and David Shmoys. The Design of Approximation Algorithms. Cambridge University Press, 2011.
	Sanjoy Dasgupta, Christos Papadimitriou and Umesh Vazirani. Algorithms. McGraw-Hill, 2006.
	Noga Alon and Joel Spencer. The Probabilistic Method, 4th edition. Wiley, 2016.
	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.

@@ Line 40: / Line 40: @@
 :'''''Combinatorial Optimization: theory and algorithms''''', 3rd edition.
 :Springer, 2008.
+|-
+|[[File:Lx=b.jpg|border|100px]]||
+:Nisheeth K. Vishnoi.
+:'''''Lx = b: laplacian solvers and their algorithmic applications'''''.
+:Foundations and Trends® in Theoretical Computer Science, 2012.
 |-
 |}