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

Information Processing Letters

Volumn 84, Issue 4, 2002, Pages 195-199

  Tsai, Yin Te ^a   Lin, Yaw Ling ^a   Hsu, F R ^a  

^a PROVIDENCE UNIVERSITY   (Taiwan)

Author keywords

Graph coloring problems; On line algorithms; Radio frequency assignment problems; Unit disk graphs

Indexed keywords

UNIT DISK GRAPHS;

ALGORITHMS; GRAPH THEORY; PROBLEM SOLVING; RADIO COMMUNICATION; RADIO INTERFERENCE; RADIO TRANSMITTERS;

DATA PROCESSING;

EID: 0037202494     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00283-1     Document Type: Article

References (11)

1. Pittel B., Weishaar R. On-line coloring of sparse random graphs and random trees. J. Algorithms. 23:(1):1997;195-205.
2. Clark B.N., Colbourn C.J., Johnson D.S. Unit disk graphs. Discrete Math. 86:1990;165-177.
3. Graf A., Stumf M., Weissenfels G. On coloring unit disk graphs. Algorithmica. 20:(3):1998;277-293.
4. Gyarfas A., Lehel J. On-line and first fit colorings of graphs. J. Graph Theory. 12:(2):1988;217-227.
5. Hale W. Frequency assignment: theory and applications. Proc. IEEE. 68:1980;1497-1980.
6. Fejes Tóth L. Regular Figures. 1964;MacMillan, New York.
7. Lovasz L., Saks M., Trotter W.T. An on-line graph coloring algorithm with sublinear performance ratio. Discrete Math. 75:1989;319-325.
8. Slusarek M. A coloring algorithm for interval graphs. Proc. Math. Foundations of Computer Science. Lecture Notes in Computer Science. 379:1989;471-480 Springer, Berlin.
9. Slusarek M. Optimal on-line coloring of circular arc graphs. Rairo-Automatique-Productique Informatique Industrielle-Automatic Control Production Systems. 5:1995;423-429.
10. Marathe M.V., Hunt H.B. III, Ravi S.S. Geometry based approximation for intersecting graphs. Proc. 4th Canadian Conference on Computational Geometry. 1992;244-249.
11. R. Peeters, On coloring j-unit sphere graphs, Few 512, Department of Economics, Tilburg University, Netherlands, 1991.