Syllabus (for 9/2)
Course Information (for 9/2)
Course Introduction
(in postscript)/
(in pdf) (for 9/2)
Overview of Greedy Choice/Optimal Substructure Methodology
(in postscript)/
(in pdf)(for 9/7)
Alternate Methods to Prove Correctness for Greedy Algorithms
(in postscript)/
(in pdf)(for 9/9)
Approximation Algorithm Example Using LP Relaxation
(in postscript)/
(in pdf) (for 10/28)
Using the Euclidean TSP Approximation Algorithm to develop a General
TSP Approximation Algorithm
(in postscript)/
(in pdf) (for 11/2)
Adversary Lower Bound Technique
(in postscript)/
(in pdf)
On-line Line Algorithms and Competitive Analysis (Part 1)
(in postscript)/
(in pdf)
On-line Line Algorithms and Competitive Analysis (Part 2)
(in postscript)
(This is the first 9 pages of Susanna Albers Mini-Course
on Competitive Online Algorithms)
Susanna Albers Mini-Course on Competitive Online Algorithms
(in ps)
Practice Problems have been moved to their own page http://classes.cec.wustl.edu/~cse441/practice.html. You can also find solutions to the practice problems there.
Return to the CSE 441T/541T Home Page