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

Authors:
Lene M. Favrholdt;Morten N. Nielsen
Affiliations:
-;-
Venue:
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Year:
2000

Citing 3
Cited 1

The greedy algorithm is optimal for on-line edge coloring

Information Processing Letters
Fair versus Unrestricted Bin Packing

SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
The Accommodating Function - A Generalization of the Competitive Ratio

WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures

Wide-Sense Nonblocking WDM Cross-Connects

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms

Quantified Score

Hi-index	0.00

Visualization

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.