Skip to content

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.

2.1

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.

2.2

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.

2.3

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.

2.4

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.

2.5

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.

2.6

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.

2.7

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.

2.8

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.

2.9

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.

2.10

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.

2.11

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.

Vercel visit statistics and public-page performance measurements each require separate consent. Neither is needed to use the website.

Website function storage (used when needed)

Security, sign-in and your chosen preferences use storage when needed. This is separate from optional statistics.

Withdrawing stops future statistics. The page reloads if analytics code needs unloading. It does not delete data already sent.

Read Cookie and storage details