Lecture Topics (tentative)

Wed, Jan 21 — Greedy I: Course Intro and Minimum Spanning Tree

Reading: KT §1.2 and §2 (especially 2.1, 2.2, 2.4)

Fri, Jan 23 — Greedy II: Algorithms for Minimum Spanning Tree

Reading: KT §4.5 (see also, §3.1-3.3 and 4.4)

Mon, Jan 26 — Greedy III: Interval scheduling

Reading: KT §4.1

Mon-Tue, Jan 26-27 — Section: More practice with greedy

Reading: KT §4.2