There is no textbook required for the course. Lecture notes are available for the current term as well as selected lecture notes from a previous term. Reference textbooks for each topic are listed in the table below. Lecture notes also contain references.
|Network flows||Ahuja, R. K., T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Upper Saddle River, NJ: Prentice Hall, 1993. ISBN: 9780136175490.|
|Data structures|| |
For both splay trees and dynamic trees:
Sleator, and Tarjan. "Self-adjusting Binary Search Trees." Journal of the ACM 32, no. 3 (July, 1985): 652-686. ISSN: 0004-5411.
Cormen, T.H., C.E. Leiserson, R.L. Rivest, and C. Stein. Introduction to Algorithms. 2nd ed. Cambridge, MA: MIT Press, 2001. ISBN: 9780262032933
|Linear programming|| |
For the Ellipsoid, 3 references are:
Groetschel, M., L. Lovasz, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. New York, NY: Springer-Verlag, 1993, chapter 3. ISBN: 9780387567402. [The standard reference on the ellipsoid. The most complete and precise description.]
For Interior-point Algorithms, a good reference is:
|Convex programming|| |
Nemirovski, Arkadi. "Lectures on Modern Convex Optimization." (PDF - 2.7 MB)
|Approximation algorithms|| |
Arora, Sanjeev. "Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and Other Geometric Problems." Journal of the ACM 45, no. 5 (September, 1998). New York, NY, USA: ACM Press. ISSN: 0004-5411.
|Streaming algorithms|| |
S. Muthukrishnan, "Data streams: Algorithms and applications", Foundations and Trends in Theoretical Computer Science, Volume 1, issue 2, 2005.
|Number-theoretic algorithms|| |
Lov'asz, L. "An Algorithmic Theory of Numbers, Graphs, and Convexity." In CBMS Regional Conference Series in Applied Mathematics (SIAM, 1986). Philadelphia, PA: Society for Industrial and Applied Mathematics, 1987. ISBN: 9780898712032.
Bach, E., and J. Shallit. Algorithmic Number Theory. Vol. 1. Cambridge, MA: MIT Press, August 26, 1996. ISBN: 9780262024051.