Worst-case analysis of a dynamic channel assignment strategy

DOI10.1016/J.DAM.2003.02.002zbMath1077.68005OpenAlexW2077744335MaRDI QIDQ1827841

Yihui Tang, Lata Narayanan

Publication date: 6 August 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2003.02.002

zbMATH Keywords

NP-completenessApproximation algorithmsCellular networksWorst-case analysisChannel assignmentGreedy algorithmsGraph multicoloring

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (2)

Greedy online frequency allocation in cellular networks ⋮ A 1-local asymptotic 13/9-competitive algorithm for multicoloring hexagonal graphs

Cites Work

• Online channel allocation in FDMA networks with reuse constraints
• Colouring proximity graphs in the plane
• Adaptive multicolouring
• Graph labeling and radio channel assignment
• Distributed Online Frequency Assignment in Cellular Networks
• Channel assignment and weighted coloring
• Distributed dynamic channel allocation for mobile computing
• Static frequency assignment in cellular networks

This page was built for publication: Worst-case analysis of a dynamic channel assignment strategy