Models and approximation algorithms for channel assignment in radio networks

DOI10.1023/A:1012311216333zbMath0996.68009OpenAlexW1523448599MaRDI QIDQ5952557

Madhav V. Marathe, S. S. Ravi, Sven O. Krumke

Publication date: 27 February 2002

Published in: Wireless Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1012311216333

zbMATH Keywords

distance-2 coloring problem

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (13)

Chromatic numbers of exact distance graphs ⋮ Design patterns in beeping algorithms: examples, emulation, and analysis ⋮ Coloring unstructured radio networks ⋮ On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations ⋮ Distributed Symmetry Breaking on Power Graphs via Sparsification ⋮ Dilation coefficient, plane-width, and resolution coefficient of graphs ⋮ Link scheduling in wireless sensor networks: distributed edge-coloring revisited ⋮ Almost optimal distributed M2M multicasting in wireless mesh networks ⋮ Routing of single-source and multiple-source queries in static sensor networks ⋮ \(L(1,1)\)-labelling of the direct product of a complete graph and a cycle ⋮ OVSF-CDMA code assignment in wireless ad hoc networks ⋮ Improved algorithms for latency minimization in wireless networks ⋮ 2-tone colorings in graph products

This page was built for publication: Models and approximation algorithms for channel assignment in radio networks