Corrigendum: Static frequency assignment in cellular networks
From MaRDI portal
Publication:1348916
DOI10.1007/S00453-001-0099-2zbMATH Open1143.68327OpenAlexW2024224348MaRDI QIDQ1348916FDOQ1348916
Authors: V. Pereyra
Publication date: 21 May 2002
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-001-0099-2
Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)
Cited In (12)
- Online Multi-Coloring with Advice
- Approximation algorithms for channel assignment with constraints
- Graph imperfection. I
- Online multi-coloring with advice
- 2-local 7/6-competitive algorithm for multicolouring a sub-class of hexagonal graphs
- Simpler multicoloring of triangle-free hexagonal graphs
- Erratum to ``Comparison of column generation models for channel assignment in cellular networks
- Static frequency assignment in cellular networks
- Frequency reassignment problem in mobile communication networks
- On interference graphs
- 2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs
- A network-flow-based lower bound for the minimum weighted integer coloring problem
This page was built for publication: Corrigendum: Static frequency assignment in cellular networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1348916)