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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, January 25, 2005, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Raphael Boog

An Approximation Scheme for Makespan Scheduling with Capacity Constraints

In this talk we consider the following scheduling problem. For every machine we have a capacity constraint limiting the number of jobs that can be executed on this machine. The goal is to find a feasible schedule which minimizes the makespan. We show that this problem admits a PTAS provided the number of machines is constant.

(Joint work with Jan Remy )


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

Previous talks by year:   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