Archives by month:
All the archives
- Final Review: Chapters 1 to 4
- Tired? Sleep instead!
- Lecture 35: Knapsack Approximation Proofs
- Lecture 34: Knapsack Approximations
- Lecture 33: Approximation of Vertex Cover
- Lecture 32: Center Selection
- Lecture 31: Greedy Reductions
- Lecture 30: Review
- Prelim II Next Tuesday
- Lecture 29: Handling NP-Complete Problems
- Lecture 28: PSPACE
- Lecture 27: P, NP, Co-NP, NP-Complete, PSPACE
- Lecture 26: The Travelling Salesman Problem
- Lecture 25: Hamiltonian Cycle Problem
- Subscribe with Bloglines
- Lecture 24: Away on break
- Lecture 23: 3-SAT
- Lecture 22: Introduction to NP Problems
- Lecture 21: NP-Complete Problems
- Lecture 20: Autofocus & Protein Sequence Design
- Lecture 19: Airline Scheduling Problem
- Lecture 18: Stable Matching Generalizations
- Lecture 17: Proof of Ford-Fulkerson
- Lecture 16: More Network Flow
- Lecture 15: Network Flow
- Lecture 14: Review
- Lecture 13: Change Detection in Lines
- Prelim 1 Coming!
- Lecture 11: Recurrences
- Lecture 10: More Dynamic Programming
- Lecture 9: Dynamic Programming
- Lecture 8: Divide and Conquer
- I’ll be away…
- Lecture 7: Various BFS Derivatives
- Lecture 6: Kruskal’s runtime
- Lecture 5: How to prove greedy algorithms
- The CS482 course-packet cut me
- Office Hours
- Lecture 4: Minimum Spanning Trees
- Visio Graphs to Come
- HW1 Due Friday
- Lecture 3: Greedy Algorithms
- Lecture 2: Some Representative Problems
- Hello world!
- Lecture 1: Stable Matching
