Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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.
Amotz Bar-Noy, Rajeev Motwani, and Joseph Naor. The greedy algorithm is optimal for on-line edge coloring. Information Processing Letters, 44(5):251–253, 1992.
J. Boyar and K. S. Larsen. The seat reservation problem. Algorithmica, 25(4):403–417, 1999.
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.
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.
Anna R. Karlin, Mark S. Manasse, Larry Rudolph, and Daniel D. Sleator. Competitive snoopy caching. Algorithmica, 3:79–119, 1988.
Douglas B. West. Introduction to Graph Theory, page 209. Prentice Hall, Inc., 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Favrholdt, L.M., Nielsen, M.N. (2000). On-Line Edge-Coloring with a Fixed Number of Colors. In: Kapoor, S., Prasad, S. (eds) FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2000. Lecture Notes in Computer Science, vol 1974. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44450-5_8
Download citation
DOI: https://doi.org/10.1007/3-540-44450-5_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41413-1
Online ISBN: 978-3-540-44450-3
eBook Packages: Springer Book Archive