Lectures - CSCI 570, Fall 2010, TuTh Section

• Lecture 1 (PDF) (6-up PDF) (Aug 24, 2010) - administrative, hw1
• Lecture 2 (PDF) (6-up PDF) (Aug 26, 2010) - hw1
• Lecture 3 (PDF) (6-up PDF) (Aug 31, 2010) - course introduction, stable matching
• Lecture 4 (PDF) (6-up PDF) (Sep 2, 2010) - stable matching
• Lecture 5 (PDF) (6-up PDF) (Sep 7, 2010) - stable matching
• Lecture 6 (PDF) (6-up PDF) (Sep 9, 2010) - stable matching, five representative problems, algorithm analysis
• Lecture 7 (PDF) (6-up PDF) (Sep 14, 2010) - algorithm analysis, priority queues
• Lecture 8 (PDF) (6-up PDF) (Sep 16, 2010) - hw2
• Lecture 9 (PDF) (6-up PDF) (Sep 21, 2010) - priority queues, graphs
• Lecture 10 (PDF) (6-up PDF) (Sep 23, 2010) - graphs
• Lecture 11 (PDF) (6-up PDF) (Sep 28, 2010) - graphs, greedy algorithms basics
• Lecture 12 (PDF) (6-up PDF) (Sep 30, 2010) - greedy algorithms basics
• Lecture 13 (PDF) (6-up PDF) (Oct 5, 2010) - greedy algorithms basics
• Lecture 14 (PDF) (6-up PDF) (Oct 7, 2010) - hw3, shortest path algorithms
• Lecture 15 (PDF) (6-up PDF) (Oct 12, 2010) - shortest path algorithms, minimum spanning tree
• Lecture 16 (PDF) (6-up PDF) (Oct 14, 2010) - shortest path tree, minimum spanning tree, exams
• (Oct 19, 2010) - review for midterm exam (given by the TA)
• (Oct 21, 2010) - midterm exam (firm)
• Lecture 17 (PDF) (6-up PDF) (Oct 26, 2010) - divide and conquer basics
• Lecture 18 (PDF) (6-up PDF) (Oct 28, 2010) - closest pair of points, integer multiplication, convolution, FFT
• Lecture 19 (PDF) (6-up PDF) (Nov 2, 2010) - hw4, convolution, FFT
• Lecture 20 (PDF) (6-up PDF) (Nov 4, 2010) - dynamic programming basics
• Lecture 21 (PDF) (6-up PDF) (Nov 9, 2010) - dynamic programming basics, sequence alignment
• Lecture 22 (PDF) (6-up PDF) (Nov 11, 2010) - Bellman-Ford algorithm
• Lecture 23 (PDF) (6-up PDF) (Nov 16, 2010) - network flow basics
• Lecture 24 (PDF) (6-up PDF) (Nov 18, 2010) - network flow basics
• Lecture 25 (PDF) (6-up PDF) (Nov 23, 2010) - application of network flows (bipartite matching, disjoint paths)
• (Nov 25-26, 2010) - Thanksgiving holiday
• Lecture 26 (PDF) (6-up PDF) (Nov 30, 2010) - application of network flows (circulation with demands, survey design, airline scheduling, image segmentation)
• Lecture 27 (PDF) (6-up PDF) (Dec 2, 2010) - application of network flows (image segmentation, project selection, baseball elimination)

Preview:

• (Dec 14, 2010) - final exam (firm)

• Administrative
  • course administration (PDF) (6-up PDF)
  • exams (PDF) (6-up PDF)

• Programming Assignments
  • HW1 (PDF) (6-up PDF)
  • HW2 (PDF) (6-up PDF)
  • HW3 (PDF) (6-up PDF)
  • HW4 (PDF) (6-up PDF)

• Course Introduction (PDF) (6-up PDF)

• Stable Matching
  • first problem: stable matching (PDF) (6-up PDF)
  • five representative problems (PDF) (6-up PDF)

• Basics of Algorithm Analysis
  • algorithm analysis (PDF) (6-up PDF)
  • priority queues (PDF) (6-up PDF)

• Graphs (PDF) (6-up PDF)

• Greedy Algorithms
  • greedy algorithms basics (PDF) (6-up PDF) - interval scheduling, scheduling to minimize lateness, optimal caching
  • shortest path algorithms, coin changing, selecting breakpoints (PDF) (6-up PDF)
  • minimum spanning tree, clustering (PDF) (6-up PDF)

• Divide and Conquer
  • divide and conquer basics (PDF) (6-up PDF) - mergesort, counting inversions
  • closest pair of points, integer multiplication (PDF) (6-up PDF)
  • convolution, FFT (PDF) (6-up PDF)

• Dynamic Programming
  • dynamic programming basics (PDF) (6-up PDF) - weighted interval scheduling, segmented least squares, knapsack, RNA secondary structure
  • sequence alignment, Bellman-Ford algorithm (PDF) (6-up PDF)

• Network Flow
  • network flow basics (PDF) (6-up PDF) - max flow, min cut, Ford-Fulkerson algorithm, capacity scaling
  • application of network flows (PDF) (6-up PDF) - bipartite matching, disjoint paths, circulation with demands, survey design, airline scheduling, image segmentation, project selection, baseball elimination

• NP & Computational Intractability (skip)
  • basic reduction strategies (PDF) (6-up PDF)
  • NP (PDF) (6-up PDF)
  • polynomial-time reduction (PDF) (6-up PDF)