Polylogarithmic inapproximability of the radio broadcast problem (Extended abstract)

Michael Elkin; Guy Kortsarz

doi:10.1007/978-3-540-27821-4_10

Polylogarithmic inapproximability of the radio broadcast problem (Extended abstract)

Michael Elkin, Guy Kortsarz

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Abstract

We prove that there exists a universal constant c > 0 such that the Radio Broadcast problem admits no additive c · log² n-approximation, unless NP ⊆ BPTIME(n^{O(log log n)}). For graphs of at most logarithmic radius, an O(log² 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 language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Editors	Klaus Jansen, Sanjeev Khanna, Jose D. P. Rolim, Dana Ron
Publisher	Springer Verlag
Pages	105-116
Number of pages	12
ISBN (Print)	3540228942, 9783540228943
DOIs	https://doi.org/10.1007/978-3-540-27821-4_10
State	Published - 2004
Externally published	Yes

Publication series

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

Access to Document

10.1007/978-3-540-27821-4_10

Cite this

Elkin, M., & Kortsarz, G. (2004). Polylogarithmic inapproximability of the radio broadcast problem (Extended abstract). In K. Jansen, S. Khanna, J. D. P. Rolim, & D. Ron (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 105-116). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3122). Springer Verlag. https://doi.org/10.1007/978-3-540-27821-4_10

Elkin, Michael ; Kortsarz, Guy. / Polylogarithmic inapproximability of the radio broadcast problem (Extended abstract). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Klaus Jansen ; Sanjeev Khanna ; Jose D. P. Rolim ; Dana Ron. Springer Verlag, 2004. pp. 105-116 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{5083ecf43d65405a94ed18fb4b5c6956,

title = "Polylogarithmic inapproximability of the radio broadcast problem (Extended abstract)",

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.",

author = "Michael Elkin and Guy Kortsarz",

year = "2004",

doi = "10.1007/978-3-540-27821-4_10",

language = "אנגלית",

isbn = "3540228942",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "105--116",

editor = "Klaus Jansen and Sanjeev Khanna and Rolim, {Jose D. P.} and Dana Ron",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

address = "גרמניה",

}

Elkin, M & Kortsarz, G 2004, Polylogarithmic inapproximability of the radio broadcast problem (Extended abstract). in K Jansen, S Khanna, JDP Rolim & D Ron (eds), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3122, Springer Verlag, pp. 105-116. https://doi.org/10.1007/978-3-540-27821-4_10

Polylogarithmic inapproximability of the radio broadcast problem (Extended abstract). / Elkin, Michael; Kortsarz, Guy.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Klaus Jansen; Sanjeev Khanna; Jose D. P. Rolim; Dana Ron. Springer Verlag, 2004. p. 105-116 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3122).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - Polylogarithmic inapproximability of the radio broadcast problem (Extended abstract)

AU - Elkin, Michael

AU - Kortsarz, Guy

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=35048813024&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-27821-4_10

DO - 10.1007/978-3-540-27821-4_10

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.chapter???

AN - SCOPUS:35048813024

SN - 3540228942

SN - 9783540228943

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 105

EP - 116

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A2 - Jansen, Klaus

A2 - Khanna, Sanjeev

A2 - Rolim, Jose D. P.

A2 - Ron, Dana

PB - Springer Verlag

ER -

Elkin M, Kortsarz G. Polylogarithmic inapproximability of the radio broadcast problem (Extended abstract). In Jansen K, Khanna S, Rolim JDP, Ron D, editors, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2004. p. 105-116. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-27821-4_10

Polylogarithmic inapproximability of the radio broadcast problem (Extended abstract)

Abstract

Publication series

Access to Document

Other files and links

Fingerprint

Cite this