376 V. Bonifaci et al.
References
1. Akyildiz, I. F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: a
survey. Computer Networks 38(4), 393–422 (2002)
2. Ausiello, G., Protasi, M., Marchetti-Spaccamela, A., Gambosi, G., Crescenzi, P., Kann, V.:
Complexity and Approximation: Combinatorial Optimization Problems and Their Approx-
imability Properties. Springer (1999)
3. Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time-complexity of broadcast in multi-hop ra-
dio networks: an exponential gap between determinism and randomization. Journal of Com-
puter and System Sciences 45(1), 104–126 (1992)
4. Bar-Yehuda, R., Israeli, A., Itai, A.: Multiple communication in multihop radio networks.
SIAM Journal on Computing 22(4), 875–887 (1993)
5. Bermond, J. C., Corr
ˆ
ea, R. C., Yu, M. L.: Gathering algorithms on paths under interference
constraints. In: Proceedings of the 6th Italian Conference Algorithms and Complexity, Lecture
Notes in Computer Science, vol. 3998, pp. 115–126. Springer (2006). Full version to appear
in Discrete Mathematics
6. Bermond, J. C., Galtier, J., Klasing, R., Morales, N., P
´
erennes, S.: Gathering in specific
radio networks. In: 8
`
emes Rencontres Francophones sur les Aspects Algorithmiques des
T
´
el
´
ecommunications, pp. 85–88. Tr
´
egastel, France (2006)
7. Bermond, J. C., Galtier, J., Klasing, R., Morales, N., P
´
erennes, S.: Hardness and approxima-
tion of gathering in static radio networks. Parallel Processing Letters 16(2), 165–183 (2006)
8. Bermond, J. C., Galtier, J., Klasing, R., Morales, N., P
´
erennes, S.: Hardness and approxima-
tion of gathering in static radio networks. In: Proc. Foundation and Algorithms for Wireless
Networking, pp. 75–79. Pisa, Italy (2006)
9. Bermond, J. C., Gargano, L., Rescigno, A.: Gathering with minimum delay in tree sensor
networks. In: Proceedings of the 15th International Colloquium on Structural Information and
Communication Complexity, Lecture Notes in Computer Science, vol. 5058, pp. 262–276.
Springer (2008)
10. Bermond, J. C., Peters, J.: Efficient gathering in radio grids with interference. In: Septi
´
emes
Rencontres Francophones sur les Aspects Algorithmiques des T
´
el
´
ecommunications, pp. 103–
106. Presqu’
ˆ
ıle de Giens, France (2005)
11. Bermond, J. C., Yu, M. L.: Optimal gathering algorithms in multi-hop radio tree networks
with interferences. In: Proc. of the Int. Conf. on Ad-Hoc, Mobile, and Wireless Networks, pp.
204–217 (2008)
12. Bertin, P., Bresse, J. F., Sage, B.: Acc
`
es haut d
´
ebit en zone rurale: une solution “ad hoc”.
France Telecom R & D 22, 16–18 (2005)
13. Bonifaci, V., Korteweg, P., Marchetti-Spaccamela, A., Stougie, L.: An approximation algo-
rithm for the wireless gathering problem. Operations Research Letters 36(5), 605–608 (2008)
14. Bonifaci, V., Korteweg, P., Marchetti-Spaccamela, A., Stougie, L.: The distributed wireless
gathering problem. In: Proc. Int. Conf. on Algorithmic Aspects in Information and Manage-
ment, Lecture Notes in Computer Science, vol. 5034, pp. 72–83. Springer (2008)
15. Bonifaci, V., Korteweg, P., Marchetti-Spaccamela, A., Stougie, L.: Minimizing average flow
time in sensor data gathering. In: Proc. 4th Workshop on Algorithmic Aspects of Wireless
Sensor Networks, Lecture Notes in Computer Science, vol. 5389, pp. 18–29. Springer (2008)
16. Bonifaci, V., Korteweg, P., Marchetti-Spaccamela, A., Stougie, L.: Minimizing flow time in
the wireless gathering problem. In: Proceedings of the 25th International Symposium on
Theoretical Aspects of Computer Science, pp. 109–120 (2008)
17. Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge Univer-
sity Press (1998)
18. Boukerche, A. (ed.): Handbook of Algorithms for Wireless Networking and Mobile Comput-
ing. Chapman & Hall (2005)
19. Cidon, I., Kutten, S., Mansour, Y., Peleg, D.: Greedy packet scheduling. SIAM Journal on
Computing 24(1), 148–157 (1995)