Advertisement

On-Line Edge-Coloring with a Fixed Number of Colors

  • Lene Monrad Favrholdt
  • Morten Nyhave Nielsen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1974)

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.

Keywords

Bipartite Graph Competitive Ratio Input Graph Complete Bipartite Graph Probabilistic Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    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
  2. [2]
    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.zbMATHCrossRefMathSciNetGoogle Scholar
  3. [3]
    J. Boyar and K. S. Larsen. The seat reservation problem. Algorithmica, 25(4):403–417, 1999.zbMATHCrossRefMathSciNetGoogle Scholar
  4. [4]
    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
  5. [5]
    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
  6. [6]
    Anna R. Karlin, Mark S. Manasse, Larry Rudolph, and Daniel D. Sleator. Competitive snoopy caching. Algorithmica, 3:79–119, 1988.zbMATHCrossRefMathSciNetGoogle Scholar
  7. [7]
    Douglas B. West. Introduction to Graph Theory, page 209. Prentice Hall, Inc., 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Lene Monrad Favrholdt
    • 1
  • Morten Nyhave Nielsen
    • 1
  1. 1.Department of Mathematics and Computer ScienceUniversity of Southern DenmarkOdense

Personalised recommendations