Tree-Based Broadcasting in Multihop Radio Networks
IEEE Transactions on Computers
A lower bound for radio broadcast
Journal of Computer and System Sciences
Single round simulation on radio networks
Journal of Algorithms
Approximation algorithms for NP-hard problems
An Õ(n3/14)-coloring algorithm for 3-colorable graphs
Information Processing Letters
SIAM Journal on Computing
Design networks with bounded pairwise distance
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Deterministic Broadcasting Time in Radio Networks of Unknown Topology
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
On the Hardness of Approximation Spanners
APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
Minimizing broadcast latency and redundancy in ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Efficient broadcasting using network coding
IEEE/ACM Transactions on Networking (TON)
Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Time-efficient broadcasting in radio networks: a review
ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
multi-channel assignment for communication in radio networks
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
On many-to-many communication in packet radio networks
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Low-Latency broadcast scheduling in ad hoc networks
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
Gathering algorithms on paths under interference constraints
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
| Hi-index | 0.00 |
We show that the radio broadcast problem is Ω(log n)-inapproximable unless NP ⊆ BPTIME (nO(log log n)). This is the first result on the hardness of approximation of this problem. Our reduction is based on the reduction from the Label-Cover problem to the Set Cover problem due to Lund and Yannakakis [J. Assoc. Comput. Mach. 4] (5) [(1994) 960-981], and uses some new ideas.