CS 7800: Advanced Algorithms

Fall 2025

Course Schedule

This schedule will be updated continuously throughout the term.

Date Topic Reading Notes
Fri
09/05/25
Class 1: Introduction
  • Course Overview
  • Stable Matching
[slides after]
HW1 Out
[pdf] [tex]
Tue
09/09/25
Class 2: Greedy Algorithms I
  • Interval Scheduling
  • Minimizing Lateness
[slides before] [slides after]
KT 4.1–4.2
Fri
09/12/25
Class 3: Greedy Algorithms II
  • Minimum Spanning Tree
  • Duality
[slides before] [slides after]
KT 4.5-4.6
E 7
HW1 Due

HW2 Out
[pdf] [tex]
Tue
09/16/25
Class 4: Dynamic Programming I
  • Fibonacci Numbers
  • Weighted Interval Scheduling
[slides before] [slides after]
KT 6.1-6.2
Fri
09/19/25
Class 5: Dynamic Programming II
  • Segmented Least Squares
[slides before] [slides after]
KT 6.3-6.4
Tue
09/23/25
Class 6: Dynamic Programming III
  • Knapsack
  • Shortest Paths
[slides before] [slides after]
KT 6.4, 6.8-6.9
Fri
09/26/25
Class 7: Network Flow I
  • Ford-Fulkerson
  • Duality
[slides before] [slides after]
KT 7.1-7.2 HW2 Due

HW3 Out
[pdf] [tex]
Tue
09/30/25
Class 8: Network Flow II
  • Choosing Good Paths
[slides before] [slides after]
E 10.6
Fri
10/03/25
Class 9: Linear Programming I
  • Basic Concepts
  • Simplex Algorithm
[slides after]
W I
Tue
10/07/25
Class 10: Exam I
Tue
10/10/22
Class 11: Linear Programming II
  • Duality
  • Ellipsoid Algorithm
[slides before] [slides after]
W II, III
Fri
10/14/25
Class 12: Flow Applications
  • Maximum Matching
  • Image Segmentation
[slides before] [slides after]
W I