CS261: Optimization and Algorithmic Paradigms

(Winter Quarter 2007-2008)

Contact Information:

Instructor: Prof. Serge Plotkin

E-mail: plotkin@cs.stanford.edu

Office Phone: 723-0540

Office hours: Tuesday 2:00-3:30pm or by appointment (Gates 472)

TA: Chris Luhrs

E-mail: cluhrs@

Office Hours: MW 1:00-3:00pm, Terman 393

Time and Place:

Class: TTh 11:00-12:15 160-319

Announcements:

Class is cancelled Thursday 01/10/2008.

There was an omission in problem 3 of the homework. The problem set has been updated, and a correct version is now available.

On problem 3 your set of properties can be anything you want that doesn't include minimum vertex cover or maximum independent set (or some trivial restatement of those two). You should produce a set of properties that is simultaneously necessary and sufficient.

Handouts:

Course Information (PDF)
Notes for All Lectures (Updated up to 03/11/2008 lecture.) (PDF)
Homework 1 (Due at end of class 02/05/2008)(PDF)
Homework 2 (Due at end of class 02/19/2008)(PDF)
Homework 3 (Due at end of class 03/04/2008)(PDF)
UPDATED! Homework 4 (Due at end of class 03/13/2008)(PDF)