随机算法 \ 高级算法 (Fall 2016) / Course materials: Difference between revisions

From TCS Wiki
Jump to navigation Jump to search
imported>Etone
(Created page with "= Course textbook = {|border="2" cellspacing="4" cellpadding="3" rules="all" style="margin:1em 1em 1em 0; border:solid 1px #AAAAAA; border-collapse:collapse;empty-cells:show;...")
 
imported>Etone
No edit summary
 
Line 7: Line 7:
:Cambridge University Press, 1995.
:Cambridge University Press, 1995.
|-
|-
|[[File:Approximation_algorithms.jpg|border|100px]]||
|[[File:Approximation_Algorithms.jpg|border|100px]]||
: Vijay Vazirani.  
: Vijay Vazirani.  
:'''''Approximation Algorithms'''''.  
:'''''Approximation Algorithms'''''.  

Latest revision as of 01:48, 31 August 2016

Course textbook

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.
Thomas Cormen, Charles Leiserson, Ronald Rivest, and Clifford Stein.
Introduction to Algorithms, 2nd edition.
MIT Press, 2001.
Noga Alon and Joel Spencer.
The Probabilistic Method, 4th edition.
Wiley, 2016.