CSCI3160 · 2
Chapter outline · Dynamic programming and greedy algorithms
Definitions and theorem statements recorded in the web, in note order, with the exact proof steps behind their recorded connections.
0 of 11 public sections have indexed statements. This outline covers only those statements, not every theorem in the chapter. Recorded connections are still being reviewed.
Longest common subsequences
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.
Matrix-chain dynamic programming
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.
Greedy choices and dynamic programming
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.
Longest increasing subsequences: states, tails and reconstruction
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.
Reading a weighted scheduling trace
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.
Single-machine scheduling and adjacent exchanges
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.
Huffman coding and the greedy exchange
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.
Greedy optimization over matroids
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.
Knapsack: fractional greedy and zero-one dynamic programming
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.
Edit distance and dynamic programming
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.
Optimal binary search trees
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.