CS 6550 (Algorithms), Fall 2007
Course Information:
Lectures: TTh 1:30-3:00, Room ES&T L1255
Recommended (Optional!) Texts:Office hours: Klaus 2140, Tuesday 3:00, Monday 2:00
- Randomized Algorithms by Motwani and Raghavan
- Introduction to Algorithms by Cormen, Leiserson, Rivest and Stein
TA: Shiva Kintali (kintali@gmail.com) , Klaus 2210, Office hours: W 2:00-4:00
Homeworks: Approximately every two weeks.
Exam: Take home final.
______________________________
Announcements
- 8/23: There will not be a diagnostic quiz.
- 8/30: Homework 1 assigned, below. Due Sept 6.
- 9/10: See initial list of presentation topics below.
- 9/13: Homework 2 below. Please get me your project preferences asap!
- 9/18: Project assignments below.
- Please let me know asap if the schedule poses a problem for you.
- I expect to get drafts of your lecture notes by mid-October unless you are giving one of the first 3 lectures in which case I need them sooner!
- Polished versions of your notes are due before your lectures, so do leave ample time for Shiva and me to go over them before they are posted.
- 10/16: Homework 3 below. Please keep drafts coming and set up meetings if you need to.
- 10/30: Several students asked for extensions on Homework 3 until Thursday, so I am extending it for everyone. Hope this helps!
- 11/8: Class cancelled due to the Ford building being blown up. Instead we will postpone the class on property testing to November 15th (instead of my lecture on sampling colorings).
- 11/13: Please note the change to the schedule for the remainder of the lectures.
- 12/5: Extension on Final: The final is now due by noon on Friday 12/7 (under my office door).
______________________________
Lectures
- Approximation algorithms:
- Aug 21: Vertex cover, set cover, randomized rounding (CMU)
- Aug 23, 28: VC, set cover, TSP (Berkeley)
- Aug 30: Knapsack (Berkeley)
- Randomized algorithms:
- On-line Algorithms:
- Sep 18: Intro to on-line algs; paging
- Sep 20: Randomized paging
- Sep 25: The k-server problem
- Sep 27: Randomized ski-rental
- Geometric algorithms:
- Oct 2, 4: Finding convex hulls
- Oct 11: Voronoi regions (see also notes by David Mount)
- Oct 16: Delaunay triangulations
- Student presentations (TBA)