Differences

This shows you the differences between two versions of the page.

--- courses:cs211:winter2014:journals:fred:home [2014/02/24 05:09] – gisaf
+++ courses:cs211:winter2014:journals:fred:home [2014/04/02 01:40] (current) – gisaf
@@ Line 56: / Line 56: @@
-[[4.2 Scheduling tO Maximize Lateness (An Exchange Argument)]]
+[[4.2 Scheduling to Maximize Lateness (An Exchange Argument)]]
+[[4.4 Shortest Paths in a Graph]]
+[[4.5 The Minimum Spanning Tree Problem]]
+[[4.6 Implementing Kruskal's Algorithm (The Union-Find Data Structure)]]
+[[4.7 Clustering]]
+[[4.8 Huffman Codes and Data Compression]]
+[[5.1  The Mergesort Algorithm]]
+[[5.2 Further Recurrence Relations]]
+[[5.3 Counting Inversions]]
+[[5.4 Finding the Closest Pair of Points]]
+[[6.1 Weighted Interval Scheduling(A Recursive Procedure)]]
+[[6.2 Principles of Dynamic Programming(Memoization or Iteration over Subproblems)]]
+[[6.3 Segmented Least Squares(Multi-way Choices)]]
+[[6.4 Subset Sums and Knapsacks(Adding a Variable)]]
+[[7.1 The Maximum-Flow Problem and the Ford-Fulkerson Algorithm]]
+[[7.2 Maximum Flows and Minimum Cuts in a Network]]
+[[7.5 A First Application(The Bipartite Matching Problem)]]
+[[7.7 Extensions to the Maximum-Flow Problem]]