On the hardness of allocating frequencies for hybrid networks

DOI10.1016/S0304-3975(98)00156-XzbMath0912.68047OpenAlexW2057080400MaRDI QIDQ1274935

Alessandro Panconesi, Ewa Malesińska

Publication date: 12 January 1999

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00156-x

zbMATH Keywords

approximation algorithmsfrequency allocationhybrid networks

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Optimization, approximation, and complexity classes
• List \(T\)-colorings of graphs
• Recursive construction for 3-regular expanders
• Minimax relations for the partial q-colorings of a graph
• Simple heuristics for unit disk graphs
• Recent results in hardness of approximation
• Unnamed Item
• Unnamed Item

This page was built for publication: On the hardness of allocating frequencies for hybrid networks