Lecture Topics W 2011

  • Note: 2011 dates are for completed/planned lectures for this quarter, dates without /11, are from 2007 offering (so may not be accurate)
  • 1. 1/4/11. Introduction, Disk sorting: solving the right problem (PP chap. 1), Aha algorithms: Find mising INT, (PP chapter 2)

  • 2. 1/6/11 Aha algorithms: anagrams, rotate array (PP chap. 2), Writing Correct Programs, binary search, (PP. chap. 4)

  • 3. 1/11/11 testing (PP chap.5), profiling (web handout), Matching (KT 7.5, CLRS 26.3), Network Flow intro (KT 7.1, CLRS 26.1)

  • 4. 1/13/11 Residual graphs, Ford-Fulkerson Algorithm, Max-Flow Min-cut theoerem (KT chap 7, CLRS 26)

  • 5. 1/18/11 shortest A-path algorithm (web site notes)

  • 6. 1/20/11 Max-Flow Min-cut (KT 7.2); Network flow applications: Matching (KT 7.5), disjoint paths and connectivity (7.6), sources and demands (7.7)

  • 7. 1/25/11 Applications: capacity lower bounds (KT 7.7), matrix rounding, vertex disjoint paths, project selection (KT 7.11)

  • 8. 1/27/11 weighted matching (KT 7.13), general matching, min-cost flow Linear and Integer Programming: formulations, applications (KT 11.6; CLRS29.1,2)

  • 9. 2/1/11 linear programming, min-cost flow formulation; PP Chapter 6: Performance improvement (n-body problem)

  • 10. 2/3/11 PP Chapter 7: Estimating. midterm review

  • 11. 2/8/11 Midterm

  • 12. 2/10/11 Easy/Hard problems: P, NP, problem instances, reductions (CLRS 34, KT 8)

  • 13. 2/15/11 proof that shortest path with negative cycles is NP-hard; What does NP-C/NP-hard really mean. Dealing with hard problems: Subset sum example (KT 6.4) approximation algorithms

  • 14. 2/17/2011 Approximation algorithms: Subset Sum Greedy algorithm, polynomial approximation scheme (KT 11.8), Scheduling (KT 11.1), Vertex Cover using LP (KT 11.6)

  • 15. 2/22/2011 Aproximation Algorithms: Binpacking (see 3.3 in approxmation alg. book, p. 73). TSP: TSP is hard to approximate in general, special cases: metric TSP (CLRS 35.2 + and Approx book, 2.4:
  • approximation bookdownload page
  • T SP-approx. link see 3.4.1. ),

  • 16. 2/24/2011 Algorithm Design Techniques, PP 8 Code Tuning, chapter 9 PP

  • 17. 3/1/2011 Squeezing space, chapter 10 PP Sampling, Random permutations: chapter 12
  • 18. 3/3/2011 Parallel algorithms: PRAM model, basic algorithms

  • 19. 3/8/2011 Parallel Algorithms: bitonic sort (web link), Review/summary

  • 20. 3/10/2011 In class final: open book/notes

  • 21. 2/26

  • 22. 2/28

  • 23. 3/2

  • 24. 3/5

  • 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/ Midterm II dealing with hard problems: vertex cover, special cases (bipartite, tree), approx. algorithm (35.1), LP formulation (35.4). Vetex cover continued: LP, branch&bound