高级算法 (Fall 2023) / Course materials
From TCS Wiki
Revision as of 13:39, 10 September 2023 by
Etone
(
talk
|
contribs
)
(
→References and further readings
)
(
diff
)
← Older revision
|
Latest revision
(
diff
) |
Newer revision →
(
diff
)
Jump to navigation
Jump to search
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.
Navigation menu
Personal tools
Log in
Namespaces
Page
Discussion
English
Views
Read
View source
View history
More
Search
课程主页
首页
组合数学
随机算法
讨论班
近似算法讨论班
links
EtoneWiki
EddyWiki
Wikipedia
MathWorld
Nestia.com
Help
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information