First Page | Document Content | |
---|---|---|
Date: 2013-11-01 17:11:36Computational complexity theory Packing problems Theory of computation Bin packing problem Bin | Approximating Bin Packing within O(log OP T · log log OP T ) bins Thomas Rothvoß Department of Mathematics, MIT TCS+ Online Seminar May 22, 2013Add to Reading ListSource URL: www.math.washington.eduDownload Document from Source WebsiteFile Size: 492,41 KBShare Document on Facebook |