Back to Results
First PageMeta Content
Computational complexity theory / Mathematics / NP-complete problems / Theory of computation / Packing problems / Operations research / Approximation algorithms / Knapsack problem / Vertex cover / Bin packing problem / Hardness of approximation / Algorithm


Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014
Add to Reading List

Document Date: 2014-06-04 08:46:15

Open Document

File Size: 158,95 KB

Share Result on Facebook