Back to Results
First PageMeta Content
Complexity classes / Mathematical optimization / Operations research / NP-complete problems / Strongly NP-complete / Polynomial-time approximation scheme / Job shop scheduling / Knapsack problem / Optimization problem / Theoretical computer science / Computational complexity theory / Applied mathematics


15-854: Approximations Algorithms Topic: Dynamic Programming Scribe: Mihir Kedia
Add to Reading List

Document Date: 2005-10-28 08:20:42

Open Document

File Size: 134,06 KB

Share Result on Facebook
UPDATE