Reading Assignments

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

• Reading for Week of March 16th: Ford-Fulkerson Algorithm for finding a maximum flow in a network (Section 7.2)
• Reading for Week of March 2nd: Shortest Paths in Graphs, 0-1 Knapsack, Edit Distance, Matrix-Chain Multiplication (Sections 6.1-6.5)
• Reading for Week of February 16th and 23rd (MW Class): 0-1 Knapsack, Edit Distance, Matrix-Chain Multiplication (Sections 6.3, 6.4, 6.5)
• Reading for Week of February 9th: 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 February 2nd: Integer Multiplication, Finding Medians, Matrix Multiplication, Fast Fourier Transform (Sections 2.1, 2.4, 2.5, 2.6)
• Reading for Weeks of January 19th and January 26th: 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)