Lecture Topics (tentative)
Wed, Jan 22 — Course Intro (Notes)
Reading: KT §1.2 and §2 (especially 2.1, 2.2, 2.4)
Fri, Jan 24 — Greedy I: Algorithms for Minimum Spanning Tree (Notes)
Reading: KT §4.5 (see also, §3.1-3.3)
Mon, Jan 27 — Greedy II: The Cut & Cycle Lemmas (Notes)
Reading: KT §4.5 (see also, §4.2)
Wed, Jan 29 — Greedy III: Greedy Stays Ahead (Notes)
Reading: KT §4.1
Fri, Jan 31 — Dynamic Programming I (Notes)
Reading: Lecture Reading (see also, §6.1-6.2)
Mon, Feb 3 — Dynamic Programming II: Edit Distance (Notes)
Reading: KT §6.6
Wed, Feb 5 — Dynamic Programming III: Edit Distance Analysis (Notes)
Reading: KT §6.6
Fri, Feb 7 — Dynamic Programming IV: Bellman-Ford (Notes)
Reading: KT §6.8
Mon, Feb 10 — Dynamic Programming V: RNA Folding (Notes)
Reading: KT §6.5
Wed, Feb 12 — Stable Matching I (Notes)
Reading: KT §1.1
Fri, Feb 14 — Stable Matching II: Analysis of Gale-Shapley (Notes)
Reading: KT §1.1
Mon, Feb 17 —
February Break: NO CLASS
Wed, Feb 19 —
Network Flow Basics (Notes)
Reading: KT §7.1,7.5
Fri, Feb 21 — Network Flow: Max Bipartite Matching (Notes)
Reading: KT §7.5-7.6
Mon, Feb 24 — Network Flow: Ford-Fulkerson (Notes)
Reading: KT §7.1-7.2
Wed, Feb 26 — Ford-Fulkerson Analysis: Max Flow / Min Cut (Notes)
Reading: KT §7.2-7.3
Fri, Feb 28 — Min Cut and Kőnig's Theorem (Notes)
Reading: KT §7.2-7.3
Mon, Mar 3 — Network Flow Reductions (Notes)
Reading: KT §7.8-7.12
Wed, Mar 5 — Mathematical Algorithms I: Karatsuba Integer Multiplication (Notes)
Reading: KT §5.5 (see also, §5.1-5.2)
Fri, Mar 7 — Mathematical Algorithms II: Convolution & Polynomial Multiplication (Notes)
Reading: KT §5.6
Mon, Mar 10 — Mathematical Algorithms III: The Fast Fourier Transform (Notes)
Reading: KT §5.6
Wed, Mar 12 —
Mathematical Algorithms IV: Solving Linear Systems (Notes)
Fri, Mar 14 —
NP-Hardness I: Boolean Satisfiability and NP (Notes)
Reading: KT §8.2-8.4
Mon, Mar 17 — NP-Hardness II: Poly-Time Reductions for NP-Hardness (Notes)
Reading: KT §8.1-8.3
Wed, Mar 19 — NP-Hardness III: More NP-Hard Problems (Notes)
Reading: KT §8.1-8.2
Fri, Mar 21 — NP-Hardness IV: Hamiltonian Path & Traveling Salesperson (Notes)
Reading: KT §8.4
Mon, Mar 24 — NP-Hardness V: SAT is Hard (Notes)
Reading: KT §8.5