Reception capacity: definitions, game theory and hardness

DOI10.1007/978-3-030-34405-4_6zbMATH Open1542.94009MaRDI QIDQ6536157

Michael Dinitz, Naomi Ephraim

Publication date: 5 April 2024

zbMATH Keywords

wireless radio networkscapacity of wireless networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Applications of game theory (91A80) Communication theory (94A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Wireless capacity with arbitrary gain matrix
• The weighted perfect domination problem
• A lower bound for radio broadcast
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• How Well Can Graphs Represent Wireless Interference?
• Intrinsic Robustness of the Price of Anarchy
• On the np-completeness of certain network testing problems
• Combination Can Be Hard: Approximability of the Unique Coverage Problem
• Relations between average case complexity and approximation complexity
• On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
• Dominating sets in n‐cubes
• An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
• Centralized broadcast in multihop radio networks
• Logarithmic inapproximability of the radio broadcast problem
• Faster communication in known topology radio networks
• Polylogarithmic Additive Inapproximability of the Radio Broadcast Problem

This page was built for publication: Reception capacity: definitions, game theory and hardness