Variable Sized Online Interval Coloring with Bandwidth

Abstract We consider online coloring of intervals with bandwidth in a setting where colors have variable capacities. Whenever the algorithm opens a new color, it must choose the capacity for that color and cannot change it later. A set of intervals can be assigned the same color a of capacity Ca if the sum of bandwidths of intervals at each point does not exceed Ca. The goal is to minimize the total capacity of all the colors used. We consider the bounded model, where all capacities must be chosen in the range (0,1], and the unbounded model, where the algorithm may use colors of any positive capacity. For the absolute competitive ratio, we give an upper bound of 14 and a lower bound of 4.59 for the bounded model, and an upper bound of 4 and a matching lower bound of 4 for the unbounded model. We also consider the offline version of these problems and show that whereas the unbounded model is polynomially solvable, the bounded model is NP-hard in the strong sense and admits a 3.6-approximation algorithm.

[1]  H. A. Kierstead,et al.  The Linearity of First-Fit Coloring of Interval Graphs , 1988, SIAM J. Discret. Math..

[2]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[3]  Leah Epstein,et al.  Online Interval Coloring and Variants , 2005, ICALP.

[4]  Edward G. Coffman,et al.  Approximation algorithms for bin packing: a survey , 1996 .

[5]  Gerhard J. Woeginger,et al.  Developments from a June 1996 seminar on Online algorithms: the state of the art , 1998 .

[6]  D. K. Friesen,et al.  Variable Sized Bin Packing , 1986, SIAM J. Comput..

[7]  Richard M. Karp,et al.  An efficient approximation scheme for the one-dimensional bin-packing problem , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[8]  Amos Fiat,et al.  On-line routing of virtual circuits with applications to load balancing and machine scheduling , 1997, JACM.

[9]  Jun Qin,et al.  Coloring interval graphs with first-fit , 1995, Discret. Math..

[10]  Steven S. Seiden,et al.  On the online bin packing problem , 2001, JACM.

[11]  Frank D. Murgolo.  An Efficient Approximation Scheme for Variable-Sized Bin Packing , 1987, SIAM J. Comput..

[12]  D. T. Lee,et al.  A simple on-line bin-packing algorithm , 1985, JACM.

[13]  G. S. Lueker,et al.  Bin packing can be solved within 1 + ε in linear time , 1981 .

[14]  Jeffrey D. Ullman,et al.  The performance of a memory allocation algorithm , 1971 .

[15]  Sanjoy K. Baruah,et al.  On the competitiveness of on-line real-time task scheduling , 2004, Real-Time Systems.

[16]  Steven S. Seiden.  An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing , 2001, SIAM J. Discret. Math..

[17]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[18]  Rajiv Raman,et al.  Buffer minimization using max-coloring , 2004, SODA '04.

[19]  N. S. Narayanaswamy,et al.  Dynamic Storage Allocation and On-Line Colouring Interval Graphs , 2004, COCOON.

[20]  Thomas Erlebach,et al.  Online Coloring of Intervals with Bandwidth , 2003, WAOA.

[21]  Marek Chrobak,et al.  On Some Packing Problem Related to Dynamic Storage Allocation , 1988, RAIRO Theor. Informatics Appl..

[22]  János Csirik,et al.  On-line packing and covering problems (Chapter 7) , 1998 .

[23]  Leah Epstein,et al.  Online interval coloring with packing constraints , 2005, Theor. Comput. Sci..

[24]  Tommy R. Jensen,et al.  Graph Coloring Problems , 1994 .

[25]  LEAH EPSTEIN,et al.  New Bounds for Variable-Sized Online Bin Packing , 2003, SIAM J. Comput..

[26]  János Csirik.  An on-line algorithm for variable-sized bin packing , 2004, Acta Informatica.

[27]  M. Golummc.  Algorithmic graph theory and perfect graphs , 1980 .

[28]  Amos Fiat,et al.  An improved algorithm for online coloring of intervals with bandwidth , 2006, Theor. Comput. Sci..