Back to Results
First PageMeta Content
Computational complexity theory / Theory of computation / Complexity classes / Strong NP-completeness / Polynomial-time approximation scheme / Bin / Packing problems / NP-complete problems / Bin packing problem


Bin Pa king via Dis repan y of Permutations F. Eisenbrand, D. Palv olgyi & T. Rothvo Cargese Workshop 2010
Add to Reading List

Document Date: 2013-11-01 17:11:36

Open Document

File Size: 430,96 KB

Share Result on Facebook
UPDATE