Instructor: Lenore Cowen,
Halligan 237; 7-5134; firstname.lastname@example.org
Office Hours: M 4:00--5:00pm, or by appointment.
Lectures: Monday and Wednesday 5.10-6.25pm,in Halligan 102.
Description: If you loved your algorithms class and can't wait for more, this is the class for you. In this pleasant and fun class, we will look at some more modern algorithms, some beautiful algorithms gems, and some areas of current research in algorithms. Topics will include using randomness in the design and analysis of algorithms, approximation algorithms, and online algorithms.
Prerequisites: Comp 160 or permission of the instructor.
the following were used in preparation of lectures (will be
extended and revised throughout the semester):
West's graph theory book, Hochbaum's book, working notes from V. Vazarani, Goemans' notes, paper of Luby, more to come.