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)

Volumn 3122, Issue , 2004, Pages 105-116

  Elkin, Michael ^a   Kortsarz, Guy ^b  

^a Yale University   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; OPTIMIZATION; RADIO BROADCASTING;

BROADCAST PROBLEM; INAPPROXIMABILITY; LOWER BOUNDS; POLYLOGARITHMIC; POLYLOGARITHMIC APPROXIMATION; UNIVERSAL CONSTANTS;

APPROXIMATION ALGORITHMS;

EID: 35048813024     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27821-4_10     Document Type: Article

References (34)

1. [AB+92] B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Fast network decomposition. Proc. 11th ACM Symp. on Principles of Distr. Comp., 161-173, Aug. 1992.
2. [ABLP91] N. Alon, A. Bar-Noy, N. Linial, D. Peleg. A lower bound for radio broadcast. Journal of Computer and System Sciences 43, 290-298, 1991.
3. [ABSS93] S. Arora, L. Babai, J. Stern, and Z.Swedyk. The hardness of approximate optima in lattices, codes and linear equations. Proc. 34th IEEE Symp. on Foundations of Computer Science, 724-733, 1993.
4. [AL96] S. Arora and K. Lund. Approximation Algorithms for NP-hard Problems, D. Hochbaum, ed., PWS Publishing, 1996.
5. [AS92] N. Alon and J. Spencer. The Probabilistic Method. Wiley, 1992.
6. [B01] R. Bar-Yehuda. Private communication.
7. [BGI91] 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 Computing, 5(2):67-72, 1991.
8. [C-52] H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Mathematical Statistics, 23:493-509, 1952.
9. [CG+02] B. S. Chlebus, L. Gasieniec, A. Gibbons, A. Pelc, W. Rytter. Deterministic broadcasting in ad hoc radio networks. Distributed Computing 15(1):27-38 (2002)
10. [CGR-00] M. Chrobak, L. Gasieniec, W. Rytter. Fast Broadcasting and Gossiping in Radio Networks. FOCS 2000: 575-581
11. [CK-85] I. Chlamtac and S. Kutten. A spatial-reuse TDMA/FDMA for mobile multihop radio networks. In Proceedings IEEE INFOCOM, 389-94, 1985.
12. [CMS-03] A. F. Clementi, A. Monti, R. Silvestri. Distributed broadcast in radio networks of unknown topology. TCS 1-3(302): 337-364 (2003)
13. [CR-03] A. Czumaj and W. Rytter. Broadcasting Algorithms in Radio Networks with Unknown Topology. FOCS 2003: 492-501
14. [CW-87] Chlamtac and Weinstein The wave expansion approach to broadcasting in multihop radio networks, INFOCOM 1987.
15. [DGKR03] I. Dinur, V. Guruswami, S. Khot, and O. Regev. A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover, with Irit Dinur, Venkatesan Guruswami Proc. of 34th Symp. on Theory of Computing, 2003.
16. [EK-02] M. Elkin and G. Kortsarz. A logarithmic lower bound for radio broadcast. J. Algorithms, to appear.
17. [EK-03] M. Elkin and G. Kortsarz. Improved broadcast in radio networks Manuscript, 2004.
18. [FHKS-02] U. Feige, M. Halldo'rsson, G. Kortsarz and A. Srinivasan. Approximating the domatic number. Siam journal on computing 32(1), 172-195, 2002.
19. [FR-94] M. Furer, B. Raghavachari. Approximating the Minimum-Degree Steiner Tree to within One of Optimal. J. Algorithms 17(3): 409-423 (1994)
20. [GKR-00] N. Garg, G. Konjevod, R. Ravi. A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem. J. Algorithms 37(1): 66-84 (2000)
21. [GM95] I. Gaber and Y. Mansour. Broadcast in radio networks. The 6th ACM-Siam Symposium on Discrete Algorithms 577-585, 1995.
22. [HK-03] E. Halperin and R. Krauthgamer. Polylogarithmic inapproximability, To appear 35th Symposium on Theory of Computing (STOC'03)
23. [HK+03] E. Halperin, G. Kortsarz, R. Krauthgamer, A. Srinivasan and N. Wang, Integrality ratio for Group Steiner Trees and Directed Steiner Trees, SODA, 275-284, 2003
24. [I-02] P. Indyk. Explicit constructions of selectors and related combinatorial structures, with applications. SODA 2002: 697-704
25. [K-98] G. Kortsarz. On the hardness of approximating spanners. The first International Workshop APPROX-98, 135-146, 1998.
26. [KM-98] Kushilevitz and Mansour. Computation in Noisy Radio Networks Symposium on Discrete Algorithms, 1988.
27. [GPM03] R. Gandhi, S. Parthasarathy and A. Mishra. Minimizing Broadcast Latency and Redundancy in Ad Hoc Networks. To appear in the Proc. of the Fourth ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC'03), Jun. 2003.
28. [KP02] D. Kowalski and A. Pelc, Deterministic broadcasting time in radio networks of unknown topology, Proc. 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2002), 2002, 63-72.
29. [KP-03] D. Kowalski and A. Pelc, Broadcasting in undirected ad hoc radio networks Symposium on Principles of distributed computing (PODC), 73-82, 2003
30. [LS-91] N. Linial and M. Saks. Decomposing graphs into regions of small diameter. Proc. of the 2nd ACM-SIAM Symp. on Discr. Alg.,320-30, 1991.
31. [LY94] C. Lund and M. Yannakakis. On the hardness of approximating minimization problems. J. Assoc. Comput. Mach.,41(5):960-981, 1994.
32. [MR-95] R. Motwani, P. Raghavan. Randomized Algorithms. Cambridge University Press., 1995.
33. [R98] R. Raz. A Parallel Repetition Theorem, SIAM Journal of computing, 27(3) (1998) 763-803.
34. [RS97] R. Raz, S. Safra. A Sub-Constant Error-Probability Low-Degree Test, and a Sub-Constant Error-Probability PCP Characterization of NP. STOC, 575-584