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

DOI10.1016/S0020-0190(02)00283-1zbMATH Open1042.68096MaRDI QIDQ1853136FDOQ1853136

Authors: Yaw-Ling Lin, Yin Te Tsai, F. R. Hsu Edit this on Wikidata

Publication date: 21 January 2003

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

Recommendations

• scientific article; zbMATH DE number 1263991
• Models and approximation algorithms for channel assignment in radio networks
• scientific article; zbMATH DE number 1769307
• scientific article; zbMATH DE number 1795717
• Three results on frequency assignment in linear cellular networks

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)

Cites Work

• Unit disk graphs
• On coloring unit disk graphs
• Title not available (Why is that?)
• On-line and first fit colorings of graphs
• An on-line graph coloring algorithm with sublinear performance ratio
• On-Line Coloring of Sparse Random Graphs and Random Trees
• Optimal on-line coloring of circular arc graphs
• Title not available (Why is that?)

Cited In (3)

• A tight bound for online colouring of disk graphs
• Location-oblivious distributed unit disk graph coloring
• Local search algorithms for the radio link frequency assignment problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853136)