Fall 2010

Instructor: Adam Smith

Office hours: Wednesdays, 3pm-5pm, IST 338K

Date | Syllabus | Reading | Handouts/Homework |
---|---|---|---|

Mon, Aug 23 | Introduction, stable matching (slides) | KT, Chap. 1 | Course Announcement |

Wed, Aug 25 | Stable matching analysis, asymptotic growth (slides) | KT, Chap. 2 | |

Fri, Aug 27 | Asymptotic growth, basic data structures (slides) | KT, Chap. 2 | Homework 1 out (pdf, tex) |

Mon, Aug 30 | Graphs (slides) | KT, Chap. 3 | |

Wed, Sep 1 | No lecture. | ||

Fri, Sep 3 | Greedy algorithms: interval scheduling (slides) | KT, Chap. 4.1 | |

Mon, Sep. 6 | Labor day -- no lecture. | ||

Wed, Sep 8 | Greedy algorithms: interval partitioning (slides) | KT, Chap. 4.2 | Homework 2 out (pdf, tex) |

Fri, Sep 10 | Greedy graph algorithms: topological sort, Dijkstra (slides) | KT, Chap. 4 | |

Mon, Sep. 13 | Greedy graph algorithms: implementing Dijsktra, MST (slides) | KT, Chap. 4 | Homework 3 out (pdf, tex) |

Wed, Sep. 15 | More on MST. Huffman codes. (slides) | KT, Chap. 4, Erickson greedy notes | |

Fri, Sep. 17 | Divide and Conquer, recurrences review (slides) | KT, Chap. 5.1, 5.2 | Homework 4 out (pdf, tex) |

Mon, Sep. 20 | Divide and Conquer: master method, Strassen (see slides from lecture 10) | KT, Chap. 5 | |

Wed, Sep. 22 | Backtracking: independent set, knapsack, linear recurrences | Erickson notes 2, B, Recurrences | |

Fri, Sep. 24 | Dynamic programming: Fibonacci, Weighted Interval Cover, fire alarm! (slides) | KT, Chap. 6.1, 6.2 | |

Mon, Sep. 27 | Dynamic programming: knapsack, grid graphs (slides) | KT, Chap. 6.4 | |

Wed, Sep. 29 | Dynamic programming: segmented least squares, homework problem dscussion (slides) | KT, Chap. 6.4 | |

Thu, Sep. 30 | Midterm 1, 08:15-10:15pm, Willard 75 | ||

Fri, Oct. 1 | Dynamic programming: least common subsequence in linear space (slides) | KT, Chap. 6.4 | Homework 5 out (pdf, tex) |

Mon, Oct. 4 | Dynamic programming: Bellman-Ford (slides) | KT, Chap. 6 | Homework 6 (pdf, tex) |

Wed, Oct. 6 | Bellman-Ford review, Flows and Cuts (slides) | KT, Chap. 7 | |

Fri, Oct. 8 | Flows and Cuts, part II (slides linked above) | KT, Chap. 7 | |

Mon, Oct. 11 | Maximum Bipartite Matching (slides) | KT, Chap. 6 | |

Wed, Oct. 13 | Faster algorithms: capacity scaling (slides) | KT, Chap. 7 | |

Fri, Oct. 15 | Applications of maxmimum flow (slides) | KT, Chap. 7 | |

Mon, Oct. 18 | Min-weight perfect matching (summary) | KT, Chap. 7. See also Erickson "Extensions to max flow" | |

Wed, Oct. 20 | Linear programming: definitions, examples | Erickson "Linear programming" | |

Fri, Oct. 22 | Linear programming: duality | Erickson "Linear programming" | |

Oct. 25-29 | No class. | Homework 7 (pdf, tex) | |

Mon, Nov. 1 | Undecidability and hardness, part 1 (slides for whole week) | ||

Wed, Nov. 3 | Undecidability and hardness, part 2 (slides for whole week) | ||

Fri, Nov. 5 | NP and reductions among NP problems (slides for whole week) | Homework 8 (pdf, tex) | |

Mon, Nov. 8 | No class. | ||

Wed, Nov. 10 | Review for midterm | ||

Thu, Nov. 11 | Midterm 2, 08:15-10:15pm, 165 Willard bldg. | ||

Fri, Nov. 12 | NP-completeness, part 1 (slides) | ||

Mon, Nov. 15 | NP-completness, part 2 (slides above) | ||

Wed, Nov. 17 | Example reductions: 3D-matching (slides) | ||

Fri, Nov. 19 | More reductions (no slides) | ||

Mon, Nov. 29 | Beyond NP-completness: Exact Algorithms (slides for whole week) | ||

Wed, Dec. 1 | Beyond NP-completness: Approximation Algorithms Part 1 | ||

Fri, Dec. 3 | Beyond NP-completness: Approximation Algorithms Part 2 | ||

Mon, Dec. 6 | Randomized Algorithms Part 1 (slides) | ||

Wed, Dec. 1 | Randomized Algorithms Part 2 (slides) | ||

Fri, Dec. 3 | Randomized Algorithms Part 3 (slides above) | ||

Monday, Dec. 13 | Final exam, 08:00A - 09:50A, 322 HHD EAST |

Adam Smith Last modified: Wed Sep 15 15:00:10 EDT 2010