Approximation algorithms for channel assignment with constraints

DOI10.1016/S0304-3975(00)00388-1zbMath0983.68139OpenAlexW2081777937MaRDI QIDQ5958140

Jeannette C. M. Janssen, Lata Narayanan

Publication date: 3 March 2002

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00388-1

zbMATH Keywords

approximation algorithmsfrequency assignmentradio colouring

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

On the precise value of the strong chromatic index of a planar graph with a large girth

Cites Work

• Unnamed Item
• Online channel allocation in FDMA networks with reuse constraints
• Corrigendum: Static frequency assignment in cellular networks
• Adaptive multicolouring
• Colouring weighted bipartite graphs with a co-site constraint
• Channel assignment and weighted coloring

This page was built for publication: Approximation algorithms for channel assignment with constraints