Polylogarithmic inapproximability of the radio broadcast problem (Extended abstract)

Michael Elkin, Guy Kortsarz

Research output: Chapter in Book/Report/Conference proceedingChapter

12 Scopus citations

Abstract

We prove that there exists a universal constant c > 0 such that the Radio Broadcast problem admits no additive c · log2 n-approximation, unless NP ⊆ BPTIME(nO(log log n)). For graphs of at most logarithmic radius, an O(log2 n) additive approximation algorithm is known, hence our lower bound is tight. To the best of our knowledge, this is the first tight additive polylogarithmic approximation result.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsKlaus Jansen, Sanjeev Khanna, Jose D. P. Rolim, Dana Ron
PublisherSpringer Verlag
Pages105-116
Number of pages12
ISBN (Print)3540228942, 9783540228943
DOIs
StatePublished - 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3122
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Polylogarithmic inapproximability of the radio broadcast problem (Extended abstract)'. Together they form a unique fingerprint.

Cite this