CSEP 521Applied Algorithms

Fall 2009Course Introduction

Lecture 1 - Intro, Graph Algorithms 2

Outline for the Evening

• Course administration

• Stable Marriage Problem

• Algorithm Analysis

Lecture 1 - Intro, Graph Algorithms 3

Instructors

• Instructor– Richard Ladner– ladner@cs.washington.edu– 206 543-9347

• TA– Shani Jayant– cjayant@cs.washington.edu – Office hours: Tuesday and Thursday 6:30-7:30 via

Microsoft Messenger: shani.jayant@gmail.com

Lecture 1 - Intro, Graph Algorithms 4

October 26

• I am out of town the week of October 26

• Options– Monday, December 14th – Some other evening during the quarter

Lecture 1 - Intro, Graph Algorithms 5

Resources

• CSEP 521 Course Web Page– http://www.cs.washington.edu/csep521

• Text Book– Algorithm Design by Kleinberg and Tardos

• E-mail list– For information from instructors– Check web page to sign up

• Message Board– For discussion

Lecture 1 - Intro, Graph Algorithms 6

Engagement by Students

• Weekly Assignments from the text– Algorithm design and evaluation

• In-class activities• Project with a written report

– Evaluate several alternative approaches to algorithmically solve a problem

– Must include readings from literature– May include an implementation study– May be done in small teams

Lecture 1 - Intro, Graph Algorithms 7

Project

• The one page project proposal is due in class on Monday, November 2, 2009.

• The final report is due Tuesday, December 8, 2009. Final reports must be uploaded to the Project Discussion Board by 11:30 pm, Tuesday, December 8, 2009.

• All students are required to read and comment on at least 3 other reports by 11:30 pm, Wednesday December 16, 2009. All comments should be respectful and add some value to the particular project report that is being commented on.

Lecture 1 - Intro, Graph Algorithms 8

Final Exam and Grading

• There will be no Final Exam

• Percentages– Weekly Assignments 60%– Project 40%

Lecture 1 - Intro, Graph Algorithms 9

Some Topics

• Graph Algorithms

• Clustering Algorithms

• Dynamic Programming

• Linear Program (my notes)

• Network Flow

• Data Compression (my notes)

• NP-Completeness and Intractability

Lecture 1 - Intro, Graph Algorithms 10

Reading

• Chapters 1 and 2