Lecture Topics (tentative)

Mon, Aug 24— Course Intro: Tiling Problems

Reading: KT § 1.2

Wed, Aug 26— Stable Matching I: Gale-Shapley Algorithm

Reading: KT § 1.1

Fri, Aug 28— Stable Matching II: Analyzing Gale-Shapley

Reading: KT § 1.1, 2.3

Mon, Aug 31— Greedy Stays Ahead: Interval Scheduling

Reading: KT § 4.1^M

Wed, Sep 2— Greedy Exchange Argument: Optimal Prefix Codes

Reading: KT § 4.8^M

Fri, Sep 4— Greedy Exchange Argument: Huffman's Algorithm

Reading: KT § 4.8

Wed, Sep 9— Algorithms for Minimum Spanning Tree

Reading: KT § 4.5

Fri, Sep 11— Dynamic Programming I: Weighted Interval Scheduling

Reading: KT § 6.1

Mon, Sep 14— Dynamic Programming II: Edit Distance

Reading: KT § 6.6

Wed, Sep 16— Dynamic Programming III: Shortest Paths and the Bellman-Ford Algorithm

Reading: KT § 6.8

Fri, Sep 18— Dynamic Programming IV: RNA Secondary Structure Prediction

Reading: KT § 6.5