Polylogarithmic additive inapproximability of the radio broadcast problem

SIAM Journal on Discrete Mathematics

Volumn 19, Issue 4, 2005, Pages 881-899

  Elkin, Michael ^a   Kortsarz, Guy ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Approximation; Broadcast; Radio

Indexed keywords

ADDITIVE APPROXIMATION RATIO; POLYLOGARITHMIC ADDITIVE INAPPROXIMABILITY; RADIO BROADCAST PROBLEM;

APPROXIMATION THEORY; GRAPH THEORY; INFORMATION DISSEMINATION; PROBLEM SOLVING;

RADIO BROADCASTING;

EID: 33751179464     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480104445319     Document Type: Article

References (24)

1. N. ALON, A. BAR-NOY, N. LINIAL, AND D. PELEG, A lower bound for radio broadcast, J. Comput. System Sci., 43 (1991), pp. 290-298.
2. S. ARORA, L. BASAI, J. STERN, AND Z. SWEEDYK, The hardness of approximate optima in lattice codes, in Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, 1993, pp. 724-733.
3. S. ARORA AND K. LUND, Approximation Algorithms for NP-Hard Problems, D. Hochbaum, ed., PWS Publishing, Boston, MA, 1996.
4. R. BAR-YEHUDA, R. O. GOLDREICH, AND A. ITAI, Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection, Distributed Comput., 5 (1991), pp. 67-72.
5. B. S. CHLEBUS, L. GASIENIEC, A. GIBBONS, A. PELC, AND W. RYTTER, Deterministic broadcasting in ad hoc radio networks, Distributed Comput., 15 (2002), pp. 27-38.
6. M. CHROBAK, L. GASIENIEC, AND W. RYTTER, Fast broadcasting and gossiping in radio networks, in Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, Redondo Beach, CA, 2000, pp. 575-581.
7. I. CHLAMTAC AND S. KUTTEN, A spatial-reuse TDMA/FDMA for mobile multihop radio networks, in Proceedings of the IEEE INFOCOM, 1985, pp. 389-394.
8. A. F. CLEMENTI, A. MONTI, AND R. SILVESTRI, Distributed broadcast in radio networks of unknown topology, Theoret. Comput. Sci., 302 (2003), pp. 337-364.
9. Preliminary version appeared in Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms, Washington, DC, 2001, pp. 709-718.
10. A. CZUMAJ AND W. RYTTER, Broadcasting algorithms in radio networks with unknown topology, in Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, 2003, pp. 492-501.
11. I. CHLAMTAC AND O. WEINSTEIN, The wave expansion approach to broadcasting in multihop radio networks, in Proceedings of the IEEE INFOCOM, 1987, pp. 874-881.
12. M. ELKIN AND G. KORTSARZ, A logarithmic lower bound for radio broadcast, J. Algorithms, 52 (2004), pp. 8-25.
13. M. ELKIN AND G. KORTSARZ, An improved algorithm for radio broadcast, in Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, Vancouver, British Columbia, Canada, 2005, pp. 222-231.
14. N. GARG, G. KONJEVOD, AND R. RAVI, A polylogarithmic approximation algorithm for the group Steiner tree problem, J. Algorithms, 37 (2000), pp. 66-84.
15. I. GABER AND Y. MANSOUR, Broadcast in radio networks, in Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms, 1995, pp. 577-585.
16. R. GANDHI, S. PARTHASARATHY, AND A. MISHRA, Minimizing broadcast latency and redundancy in ad hoc networks, in Proceedings of the Fourth ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC'03), 2003, pp. 222-232.
17. E. HALPERIN AND R. KRAUTHGAMER, Polylogarithmic inapproximability, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003, pp. 585-594.
18. P. INDYK, Explicit constructions of selectors and related combinatorial structures, with applications, in Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 697-704.
19. E. KUSHILEVITZ AND Y. MANSOUR, An Ω(D log(n/D)) lower bound for broadcast in radio networks, SIAM J. Comput., 27 (1998), pp. 702-712.
20. D. KOWALSKI AND A. PELC, Deterministic broadcasting time in radio networks of unknown topology, in Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002, pp. 63-72.
21. D. KOWALSKI AND A. PELC, Broadcasting in undirected ad hoc radio networks, in Proceedings of the 16th ACM Symposium on Principles of Distributed Computing, 2003, pp. 73-82.
22. D. KOWALSKI AND A. PELC, Centralized deterministic broadcasting in undirected multi-hop radio networks, in APPROX-RANDOM, Lecture Notes in Comput. Sci. 3122, Springer, Berlin, 2004, pp. 171-182.
23. C. LUND AND M. YANNAKAKIS, On the hardness of approximating minimization problems, J. Assoc. Comput. Mach., 41 (1994), pp. 960-981.
24. R. RAZ, A parallel repetition theorem, SIAM J. Comput., 27 (1998), pp. 763-803.