A lower bound for radio broadcast
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Randomized algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Deterministic broadcasting in unknown radio networks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Selective families, superimposed codes, and broadcasting on unknown radio networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Deterministic Radio Broadcasting
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Fast broadcasting and gossiping in radio networks
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Centralized Communication in Radio Networks with Strong Interference
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Distributed contention resolution in wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
On many-to-many communication in packet radio networks
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
On the wake-up problem in radio networks
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
The complexity of making unique choices: approximating 1-in-k SAT
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Almost optimal explicit selectors
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Bounds on contention management in radio networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
| Hi-index | 0.02 |
We study the problem of computing ad-hoc selective families: Given a collection F of subsets of [n] = {1, 2, . . ., n}, a selective family for F is a collection S of subsets of [n] such that for any F ? F there exists S ∈ S such that |F ∩ S| = 1. We first provide a polynomialtime algorithm that, for any instance F, returns a selective family of size O((1 + log(Δmax/Δmin)) ċ log |F|) where Δmax and Δmin denote the maximal and the minimal size of a subset in F, respectively. This result is applied to the problem of broadcasting in radio networks with known topology. We indeed develop a broadcasting protocol which completes any broadcast operation within O(DlogΔlog n/D) time-slots, where n, D and Δ denote the number of nodes, the maximal eccentricity, and the maximal in-degree of the network, respectively. Finally, we consider the combinatorial optimization problem of computing broadcasting protocols with minimal completion time and we prove some hardness results regarding the approximability of this problem.