We will basically follow the syllabus sketched on page xx
of the text book.

Week 1:

1.2 Five Representative Problems
SDG game
DemeterF

Homework 1:
SDG question.
Problem specializations.
Design of input languages for combinatorial decision and maximization problems.

Week 2:
Chapter 3: Graphs

Homework 2:
Topological sorting implementation

Week 3:
Chapter 4:
Greedy Algorithms

Homework


================
The grade will be based on an 
open-book midterm (20%),
open-book final (30%),
homework solutions (20%) and a 
project (30%).

You should actively participate in class
with questions and answers. Please also
reply on the mailing list when you know 
an answer.