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

DOI10.1016/S0020-0190(02)00283-1zbMath1042.68096MaRDI QIDQ1853136

Yaw-Ling Lin, Yin Te Tsai, Fang-Rong Hsu

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

On-line algorithmsGraph coloring problemsRadio frequency assignment problemsUnit disk graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

A tight bound for online colouring of disk graphs ⋮ Location-oblivious distributed unit disk graph coloring

Cites Work

• An on-line graph coloring algorithm with sublinear performance ratio
• Unit disk graphs
• On coloring unit disk graphs
• On-Line Coloring of Sparse Random Graphs and Random Trees
• On-line and first fit colorings of graphs
• Optimal on-line coloring of circular arc graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: The on-line first-fit algorithm for radio frequency assignment problems.