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.
KeywordsCompetitive Ratio Online Algorithm Complete Bipartite Graph Expander Graph Majority Coloring
Unable to display preview. Download preview PDF.
- 3.Boyar, J., Ehmsen, M.R., Larsen, K.S.: Theoretical evidence for the superiority of LRU-2 over LRU for the paging problem. In: Approximation and Online Algorithms, pp. 95–107 (2006)Google Scholar
- 4.Boyar, J., Favrholdt, L.M.: The relative worst order ratio for on-line algorithms. ACM Transactions on Algorithms 3(22) (2007)Google Scholar
- 11.Kenyon, C.: Best-fit bin-packing with random order. In: 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 359–364 (1996)Google Scholar
- 12.Margulis, G.A.: Explicit constructions of concentrators. Problems of Information Transmission 9(4), 325–332 (1973)Google Scholar