Approximating Bin Packing within O(log OP T · log log OP T ) bins Thomas Rothvoß Department of Mathematics, MIT TCS Online Seminar May 22, 2013 - Computational complexity theory - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2013-11-01 17:11:36 Computational 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, 2013 Add to Reading List Source URL: www.math.washington.edu Download Document from Source Website File Size: 492,41 KB Share Document on Facebook