Online channel allocation in FDMA networks with reuse constraints
DOI10.1016/S0020-0190(98)00126-4zbMATH Open1339.68015OpenAlexW1998868900MaRDI QIDQ293383FDOQ293383
Authors: Tomás Feder, Sunil Shende
Publication date: 9 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(98)00126-4
Recommendations
Online algorithms; streaming algorithms (68W27) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Network design and communication in computer systems (68M10)
Cites Work
Cited In (6)
- Absolute and asymptotic bounds for online frequency allocation in cellular networks
- Approximation algorithms for channel assignment with constraints
- On-line algorithms for the channel assignment problem in cellular networks.
- Distributive online channel assignment for hexagonal cellular networks with constraints
- Worst-case analysis of a dynamic channel assignment strategy
- Perfectness and imperfectness of unit disk graphs on triangular lattice points
This page was built for publication: Online channel allocation in FDMA networks with reuse constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293383)