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

From TCS Wiki
Jump to navigation Jump to search
(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...")
 
Line 35: Line 35:
:'''''The Probabilistic Method''''', 4th edition.  
:'''''The Probabilistic Method''''', 4th edition.  
:Wiley, 2016.
:Wiley, 2016.
|-
|[[File:Combinatorial_Optimization.jpg|border|100px]]||
:Bernhard Korte and Jens Vygen.
:'''''Combinatorial Optimization: theory and algorithms''''', 3rd edition.
:Springer, 2008.
|-
|-
|}
|}

Revision as of 13:15, 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.
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.
File:Combinatorial Optimization.jpg
Bernhard Korte and Jens Vygen.
Combinatorial Optimization: theory and algorithms, 3rd edition.
Springer, 2008.