Three Results on Frequency Assignment in Linear Cellular Networks

DOI10.1007/978-3-642-02158-9_12zbMath1246.68267OpenAlexW1508604175MaRDI QIDQ3638448

Jiří Sgall, Marek Chrobak

Publication date: 2 July 2009

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02158-9_12

Mathematics Subject Classification ID

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

Related Items (1)

Online multi-coloring on the path revisited

Cites Work

• 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
• Channel assignment and weighted coloring
• Frequency Allocation Problems for Linear Cellular Networks
• Static frequency assignment in cellular networks

This page was built for publication: Three Results on Frequency Assignment in Linear Cellular Networks