Approximation algorithms for channel allocation problems in broadcast networks

DOI10.1002/net.20111zbMath1097.68509OpenAlexW1562753141MaRDI QIDQ5487810

Nan Wang, Samir Khuller, Rajiv Gandhi, Aravind Srinivasan

Publication date: 12 September 2006

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20111

zbMATH Keywords

distributed approximation algorithmchannel allocation problemedge partitioning problem

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Approximation algorithms (68W25)

Related Items (1)

Bi-Covering: Covering Edges with Two Small Subsets of Vertices

Cites Work

• Unnamed Item
• The deletion method for upper tail estimates
• Constant-time distributed dominating set approximation

This page was built for publication: Approximation algorithms for channel allocation problems in broadcast networks