Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, March 05, 2009, 12:15 pm
Duration: This information is not available in the database
Location: CAB G51
Speaker: Rolf Harren (Max-Planck-Institut für Informatik, Saarbrücken)
The two-dimensional bin packing problem asks for a non-overlapping, axis-parallel packing of a given list of rectangles into a minimum number of unit squares. We present a polynomial time algorithm with an approximation guarantee of 2 - which is optimal unless P=NP.
Automatic MiSe System Software Version 1.4803M | admin login