Lecture Topics W 2007

  • 1. 1/3/07. Introduction, Disk sorting: solving the right problem (PP chap. 1)

  • 2. 1/5 Aha algorsthms: Find missing INT, anagrams, rotate array (PP chap. 2)

  • 3. 1/8 Writing correct programs, binary search, testing (PP chap. 4,5)

  • 4. 1/10 Intro to profiling, primes (web handout), Matching (CLRS 26.3)

  • 5. 1/12 Matching proof, Network Flow intro (CLRS 26.1)

  • 6. 1/17 Residual graphs, Ford-Fulkerson Algorithm, Max-Flow Min-cut theoerem (26.2)

  • 7. 1/19 run time analysis, shortest A-path algorithm (web site notes)

  • 8. 1/22 More on shortest A-path algorithm, O(mn^2) run time.

  • 9. 1/24 Applications: matching, general matching, matrix rounding, disjoint paths, unit network run times

  • 10. 1/26 Edge connectivity, vertex connectivity, algorithms for unit networks

  • 11. 1/29 Linear and Integer Programming: formulations, applications (CLRS29.1,2)

  • 12. 1/31 PP Chapter 6: Performance improvement (n-body problem)

  • 13. 2/2 PP Chapter 7: Estimating. Intro to hard problems

  • 14. 2/5 Easy/Hard problems: P, NP, reductions (CLRS 34, intro)

  • 15. 2/7 Reuctions, Midterm review

  • XX. 2/9 Midterm

  • 16. 2/12 proof that subset sum is NP-hard, comments on size of inputs

  • 17. 2/14 dealing with hard problems: vertex cover, special cases (bipartite, tree), approx. algorithm (35.1), LP formulation (35.4).

  • 18. 2/16 Vetex cover continued: LP, branch&bound

  • 19. 2/21 Local search, simulated annealing

  • 20. 2/23 Approximation Algorithms for TSP (35.2 + better result)

  • 21. 2/26 Algorithm Design Techniques, PP 8

  • 22. 2/28 Code Tuning, chapter 9 PP

  • 23. 3/2 Squeezing space, chapter 10 PP

  • 24. 3/5 Sampling, Random permutations: chapter 12

  • 25. 3/7 Data structures for PS4, bin-packing approximations (Wikipedia: en.wikipedia.org/wiki/Bin_packing_problem): Next-Fit

  • 26. 3/7 AFT Review: P/NP/reductions; branch-bound

  • 27. 3/9 Better bin-packing algorithms: First Fit, First Fit decreasing

  • 28. 3/14 Midterm II