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. © Springer-Verlag 2004.
Cite
CITATION STYLE
Elkin, M., & Kortsarz, G. (2004). 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), 3122, 105–116. https://doi.org/10.1007/978-3-540-27821-4_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
