Three results on frequency assignment in linear cellular networks

DOI10.1016/j.tcs.2009.09.019zbMath1187.68718OpenAlexW2079436782MaRDI QIDQ1041229

Jiří Sgall, Marek Chrobak

Publication date: 1 December 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.09.019

zbMATH Keywords

competitive analysisonline algorithmscellular networksfrequency assignment\(\mathbb {NP}\)-completeness

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Online algorithms; streaming algorithms (68W27)

Related Items

Online Multi-Coloring with Advice ⋮ Better bounds for incremental frequency allocation in bipartite graphs ⋮ Online multi-coloring with advice

Uses Software

• CALMA

Cites Work

• Unnamed Item
• Greedy online frequency allocation in cellular networks
• Representing a planar graph by vertical lines joining different levels
• A unified approach to visibility representations of planar graphs
• Rectilinear planar layouts and bipolar orientations of planar graphs
• A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs
• Channel assignment and weighted coloring
• Frequency Allocation Problems for Linear Cellular Networks
• Models and solution techniques for frequency assignment problems
• Static frequency assignment in cellular networks