1, pp. 376??“380.
58. Raghupathy Sivakumar, Prasun Sinha, and Vaduvur Bharghavan, ???CEDAR:
Core extraction distributed ad hoc routing algorithm,??? IEEE Journal on Selected
Areas in Communications, vol. 17, no. 8, pp. 1454??“1465, 1999.
59. Ivan Stojmenovic, Mahtab Seddigh, and Jovisa Zunic, ???Dominating sets and
neighbor elimination based broadcasting algorithms in wireless networks,???
IEEE Trans. on Parallel and Distributed Systems, vol. 13, no. 1, pp. 14??“25,
2002.
60. Jie Wu and Hailan Li, ???A dominating-set-based routing scheme in ad hoc
wireless networks,??? the special issue on Wireless Networks in the Telecommunication
Systems Journal, vol. 3, pp. 63??“84, 2001.
61. V. Chv??atal, ???A greedy heuristic for the set-covering problem,??? Mathematics
of Operations Research, vol. 4, no. 3, pp. 233??“235, 1979.
62. Madhav V. Marathe, H. Breu, Harry B. Hunt III, S. S. Ravi, and Daniel J.
Rosenkrantz, ???Simple heuristics for unit disk graphs,??? Networks, vol. 25, pp.
59??“68, 1995.
63. Sudipto Guha and Samir Khuller, ???Approximation algorithms for connected
dominating sets,??? in European Symposium on Algorithms, 1996, pp. 179??“193.
64. Gabriel Robins and Alexander Zelikovsky, ???Improved steiner tree approximation
in graphs,??? in Proc. of ACM/SIAM Symposium on Discrete Algorithms,
2000.
65. Dorit S. Hochbaum andWolfgang Maass, ???Approximation schemes for covering
and packing problems in image processing and vlsi,??? Journal of ACM, vol.
Pages:
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256