Reading Assignments

From S. Dasgupta, C. Papadimitriou, U. Vazirani's, Algorithms

• Reading for Weeks of October 26th and November 2nd: Search Problems, NP-Complete Problems (8.1, 8.2)
• Reading for Week of October 19th: Flows in Networks (Sections 7.1-7.4)
• Reading for Week of September 28th : Single-Source Distances in Acyclic Graphs, 0-1 Knapsack, Edit Distance, Matrix-Chain Multiplication (Sections 6.1, 6.2, 6.3, 6.4, 6.5)
• Reading for Week of September 14th and 21st : Data Structures for Greedy Algorithms, Binary Heaps, Paths in Graphs, Breadth-First Search, Dijkstra's algorithm, Disjoint Set Data Structure, Minimum Spanning Trees (Sections 4.1-4.5, 5.1)
• Reading for Week of September 7th: Finding Medians, Matrix Multiplication (Sections 2.4, 2.5)
• Reading for Week of August 31st: Integer Multiplication, Finding Medians, Matrix Multiplication (Sections 2.1, 2.4, 2.5)
• Reading for Weeks of August 24th and August 31st: Importance of Efficient Algorithms and Algorithm Analysis, Review of Big-O Notation (Chapter 0), Arithmetic Operations (Section 1.1), Mergesort (Section 2.2, 2.3)