Back to Results
First PageMeta Content
NP-complete problems / Knapsack problem / Set cover problem / Steiner tree problem / Vertex cover / Approximation algorithm / Greedy algorithm / Dynamic programming / Minimum spanning tree / Algorithm / Time complexity / NP


CS261: A Second Course in Algorithms Lecture #15: Introduction to Approximation Algorithms∗ Tim Roughgarden† February 23, 2016
Add to Reading List

Document Date: 2016-02-28 14:26:27


Open Document

File Size: 264,12 KB

Share Result on Facebook