Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, November 28, 2017, 12:15 pm

Duration: 45 minutes

Location: OAT S15/S16/S17

Speaker: Nina Corvelo Benz

Black and White Bin Packing

We overview some hardness results and classic approximation algorithms regarding the bin packing problem. Our main focus is devoted to a specific variant of the problem, which is called the black and white bin packing. Assume we are given a set of weighted items of two colors (black and white) and we want to pack them into the minimum number of unit capacity bins so that the colors alternate in each bin. We will discuss the competitiveness of some classic algorithms like Next Fit, First Fit and Harmonic(K) in the online setting of the problem. Furthermore, the lower bound of 1+1/(2ln2) on the asymptotic approximation ratio of all online algorithms is presented. These are mostly results of a paper by Balogh, Békési, Dosa, Kellerer, and Tuza from 2012.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login