On-Line Edge-Coloring with a Fixed Number of Colors
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors available and the aim is to color as many edges as possible. We prove upper and lower bounds on the performance of different classes of algorithms for the problem. Moreover, we determine the performance of two specific algorithms, First-Fit and Next-Fit.
KeywordsBipartite Graph Competitive Ratio Input Graph Complete Bipartite Graph Probabilistic Algorithm
Unable to display preview. Download preview PDF.
- Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, and Morten N. Nielsen. Fair versus unrestricted bin packing. In Seventh Scandinavian Workshop on Algorithm 0Theory, volume 1851 of Lecture Notes in Computer Science, pages 200–213. Springer-Verlag, 2000.Google Scholar
- J. Boyar, K. S. Larsen, and M. N. Nielsen. The accommodating function — a generalization of the competitive ratio. In Sixth International Workshop on Algorithms and Data Structures, volume 1663 of Lecture Notes in Computer Science, pages 74–79. Springer-Verlag, 1999.Google Scholar
- Lene M. Favrholdt and Morten N. Nielsen. On-line edge-coloring with a fixed number of colors. Preprints 1999, no. 6, Department of Mathematics and Computer Science, University of Southern Denmark, Odense.Google Scholar
- Douglas B. West. Introduction to Graph Theory, page 209. Prentice Hall, Inc., 1996.Google Scholar