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: Thursday, October 30, 2003, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Udo Adamy

On-line Coloring of Intervals with Bandwidths

We consider the problem of on-line interval coloring in the case where the intervals have weights in (0,1] and the total weight of intersecting intervals with the same color must not exceed 1. We present an on-line algorithm for this problem that achieves a constant competitive ratio. Our algorithm is a combination of an optimal on-line algorithm for coloring interval graphs and First-Fit coloring, for which we generalize the analysis of Kierstead to the case of non-unit bandwidth.

(Joint work with Thomas Erlebach)

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