CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Almost Online Square Packing Shahin Kamali Abstract

First Page		Document Content
Date: 2014-06-21 01:14:48 Online algorithms Computer science Bin packing problem Theoretical computer science Packing problem Streaming algorithm Competitive analysis List update problem Algorithm Mathematics Applied mathematics Analysis of algorithms		CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Almost Online Square Packing Shahin Kamali Abstract Add to Reading List Source URL: www.cccg.ca Download Document from Source Website File Size: 422,88 KB Share Document on Facebook

	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
	Average-Case Analyses of First Fit and Random Fit Bin Packing Susanne Albers Michael Mitzenmachery Abstract DocID: 1r7zW - View Document
	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 DocID: 1r5rp - View Document