Logarithmic inapproximability of the radio broadcast problem

Michael Elkin, Guy Kortsarz

Research output: Contribution to journalArticlepeer-review


We show that the radio broadcast problem is Ω(log n)-inapproximable unless NP ⊆ BPTIME(n O(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 [LY94], and uses some new ideas.
Original languageEnglish GB
Pages (from-to)8-25
Number of pages18
JournalJournal of Algorithms
Issue number1
StatePublished - 2004


Dive into the research topics of 'Logarithmic inapproximability of the radio broadcast problem'. Together they form a unique fingerprint.

Cite this