The on-line first-fit algorithm for radio frequency assignment problems

Authors:
Yin-Te Tsai;Yaw-Ling Lin;F. R. Hsu
Affiliations:
Department of Computer Science and Information Management, Providence University, Taiwan, Republic of China;Department of Computer Science and Information Management, Providence University, Taiwan, Republic of China;Department of Accounting, Providence University, Taiwan, Republic of China
Venue:
Information Processing Letters
Year:
2002

Citing 4
Cited 1

An on-line graph coloring algorithm with sublinear performance ratio

Discrete Mathematics
Unit disk graphs

Discrete Mathematics - Topics on domination
On-line coloring of sparse random graphs and random trees

Journal of Algorithms
A Coloring Algorithm for Interval Graphs

MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989

A tight bound for online colouring of disk graphs

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

The radio frequency assignment problem is to minimize the number of frequencies used by transmitters with no interference in radio communication networks; it can be modeled as the minimum vertex coloring problem on unit disk graphs. In this paper, we consider the on-line first-fit algorithm for the problem and show that the competitive ratio of the algorithm for the unit disk graph G with χ(G) = 2 is 3, where χ(G) is the chromatic number of G. Moreover, the competitive ratio of the algorithm for the unit disk graph G with χ(G) (G). The average performance for the algorithm is also discussed in this paper.