Absolute and asymptotic bounds for online frequency allocation in cellular networks
From MaRDI portal
Publication:5961981
Recommendations
- Frequency Allocation Problems for Linear Cellular Networks
- Greedy online frequency allocation in cellular networks
- Efficient on-line frequency allocation and call control in cellular networks
- Deterministic online call control in cellular networks and triangle-free cellular networks
- Distributed Online Frequency Assignment in Cellular Networks
Cites work
- scientific article; zbMATH DE number 6118222 (Why is no real title available?)
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- 2-local <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mn>4</mml:mn><mml:mo stretchy="false">/</mml:mo><mml:mn>3</mml:mn></mml:math>-competitive algorithm for multicoloring hexagonal graphs
- A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs
- A Constant-Competitive Algorithm for Online OVSF Code Assignment
- An algorithmic view on OVSF code assignment
- Channel assignment and weighted coloring
- Competitive call control in mobile networks
- Distributed Online Frequency Assignment in Cellular Networks
- Distributive online channel assignment for hexagonal cellular networks with constraints
- Efficient on-line frequency allocation and call control in cellular networks
- Frequency Allocation Problems for Linear Cellular Networks
- Greedy online frequency allocation in cellular networks
- Models and solution techniques for frequency assignment problems
- Online OVSF Code Assignment with Resource Augmentation
- Online channel allocation in FDMA networks with reuse constraints
- Static frequency assignment in cellular networks
Cited in
(6)
This page was built for publication: Absolute and asymptotic bounds for online frequency allocation in cellular networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5961981)