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 - Packing problems - 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

	A COMPARISON OF OPTIMIZATION METHODS FOR MULTI-OBJECTIVE CONSTRAINED BIN PACKING PROBLEMS Philippe Olivier DocID: 1uIDg - View Document
	A semidefinite programming hierarchy for geometric packing problems David de Laat Joint work with Fernando M. de Oliveira Filho and Frank Vallentin DIAMANT Symposium – November 2012 DocID: 1rs14 - View Document
	Set Covering with Ordered Replacement: Additive and Multiplicative Gaps Friedrich Eisenbrand1 , Naonori Kakimura?2 , Thomas Rothvoß??1 , and Laura Sanità? ? ?1 1 DocID: 1rlHb - View Document
	Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014 DocID: 1rdLy - View Document
	SET COVERING WITH OUR EYES CLOSED∗ FABRIZIO GRANDONI† , ANUPAM GUPTA‡ , STEFANO LEONARDI§ , PAULI MIETTINEN¶, PIOTR SANKOWSKI§ k , AND MOHIT SINGH∗∗ Abstract. Given a universe U of n elements and a weighted DocID: 1rdoS - View Document