Gregor Reisch: Madame Arithmatica, 1508
Design & Analysis of Algorithms
COMPSCI 532 • Fall 2016
Instructor: Pankaj K. Agarwal
TA: Reza Alijani
Time: Tue, Thu 4:40-5:55 pm
Location: LSRC D106
Office Hours:
Agarwal:Tue 3:30-4:30, Fri 3:00-4:00
Alijani:Mon 4:00-5:00, Wed 1:30-2:30 in LSRC D301
This course covers design and analysis of efficient algorithms at a graduate level. Topics include:
COMPSCI 230 and 330, or equivalent courses. This course requires undergraduate background in discrete mathematics and algorithms
[KT] | J. Kleinberg and E. Tardos, Algorithm Design, Addison Wesley, 2005. |
[HP] | S. Har-Peled, Geometric Approximation Algorithms, AMS, 2013. |
[MG] | J. Matoušek and B. Gärtner, Understanding and Using Linear Programming, Springer, 2007. |
[MR] | R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press. |
[WS] | D. Williamson and D. B. Shmoys, The Design of Approximation Algorithms, Cambridge University Press, 2011. |
For assignments, collaboration among students is permitted, but students MUST write up solutions independently on their own and LIST your collaborators for each problem. The assignment questions may be similar to questions on problem sets from past offerings of this course or courses at other universities. Using any preexisting solutions from these or any other sources is strictly prohibited.