Comparing First-Fit and Next-Fit for Online Edge Coloring

We study the performance of the algorithms First-Fit and Next-Fit for two online edge coloring problems. In the min-coloring problem, all edges must be colored using as few colors as possible. In the max-coloring problem, a fixed number of colors is given, and as many edges as possible should be colored. Previous analysis using the competitive ratio has not separated the performance of First-Fit and Next-Fit, but intuition suggests that First-Fit should be better than Next-Fit. We compare First-Fit and Next-Fit using the relative worst order ratio, and show that First-Fit is better than Next-Fit for the min-coloring problem. For the max-coloring problem, we show that First-Fit and Next-Fit are not strictly comparable, i.e., there are graphs for which First-Fit is better than Next-Fit and graphs where Next-Fit is slightly better than First-Fit.

[1]  Joan Boyar,et al.  The relative worst order ratio applied to seat reservation , 2004, TALG.

[2]  Joan Boyar,et al.  Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem , 2006, WAOA.

[3]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[4]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[5]  Anna R. Karlin,et al.  Competitive snoopy caching , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[6]  C. Kenyon.  Best-fit bin-packing with random order , 1996, SODA '96.

[7]  Joan Boyar,et al.  The relative worst order ratio applied to paging , 2005, SODA '05.

[8]  Joan Boyar,et al.  The Relative Worst Order Ratio for On-Line Algorithms , 2003, CIAC.

[9]  Morten N. Nielsen,et al.  On-Line Edge-Coloring with a Fixed Number of Colors , 2000, Algorithmica.

[10]  Zvi Galil,et al.  Explicit Constructions of Linear-Sized Superconcentrators , 1981, J. Comput. Syst. Sci..

[11]  Rajeev Motwani,et al.  The Greedy Algorithm is Optimal for On-Line Edge Coloring , 1992, Inf. Process. Lett..

[12]  J. van Leeuwen,et al.  Theoretical Computer Science , 2003, Lecture Notes in Computer Science.

[13]  Leah Epstein,et al.  Separating online scheduling algorithms with the relative worst order ratio , 2006, J. Comb. Optim..

[14]  Joan Boyar,et al.  The relative worst order ratio for online algorithms , 2007, TALG.

[15]  Allan Borodin,et al.  A new measure for the study of on-line algorithms , 2005, Algorithmica.

[16]  Lene M. Favrholdt,et al.  Comparing First-Fit and Next-Fit for online edge coloring , 2010, Theor. Comput. Sci..

[17]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.