A faster distributed approximation scheme for the connected dominating set problem for growth-bounded graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4686 LNCS, Issue , 2007, Pages 59-73

  Gfeller, Beat ^a   Vicari, Elias ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Connected dominating set; Distributed algorithms; Distributed approximation scheme; Growth bounded graphs

Indexed keywords

APPROXIMATION THEORY; PARALLEL ALGORITHMS; PROBLEM SOLVING;

CONNECTED DOMINATING SET; DISTRIBUTED APPROXIMATION SCHEME; GROWTH-BOUNDED GRAPHS; NETWORK GRAPH;

GRAPH THEORY;

EID: 38049057920     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (19)

1. Alzoubi, K.M.: Connected dominating set and its induced position-less sparse spanner for mobile ad hoc networks. In: Proceedings of the 8th IEEE Intern. Symposium on Computers and Communications (ISCC), pp. 209-216. IEEE Computer Society Press, Los Alamitos (2003)
2. Blum, J., Ding, M., Thaeler, A., Cheng, X.: Connected dominating set in sensor networks and MANETs. In: Handbook of Combinatorial Optimization, pp. 329-369. Kluwer Academic Publishers, Dordrecht (2004)
3. Cheng, X., Huang, X., Li, D., Wu, W., Du, D.-Z.: A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks. Networks 42(4), 202-208 (2003)
4. Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Mathematics 86(1-3), 165-177 (1990)
5. Czygrinow, A., Hańćkowiak, M.: Distributed approximation algorithms in unit-disk graphs. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 385-398. Springer, Heidelberg (2006)
6. Das, B., Sivakumar, R., Bharghavan, V.: Routing in ad-hoc networks using a virtual backbone. In: 6th Intern. Conference on Computer Communications and Networks (IC3N '97), pp. 1-20 (1997)
7. Dubhashi, D.P., Mei, A., Panconesi, A., Radhakrishnan, J., Srinivasan, A.: Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. Journal of Computer and System Sciences 71(4), 467-479 (2005)
8. Feige, U.: A threshold of In n for approximating set cover. In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC), pp. 314-318. ACM Press, New York (1996)
9. Gfeller, B., Vicari, E.: A Randomized Distributed Algorithm for the Maximal Independent Set Problem in Growth-Bounded Graphs. In: Proceedings of the 26th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC). ACM Press, New York (2007)
10. Hunt III, H.B., Marathe, M.V., Radhakrishnan, V., Ravi, S.S., Rosenkrantz, D.J., Stearns, R.E.: NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs. J. Algorithms 26(2), 238-274 (1998)
11. Junker, H., Stager, M., Tröster, G., Blättler, D., Salama, O.: Wireless networks in context aware wearable systems. In: Proceedings of the 1st European Workshop on Wireless Sensor Networks (EWSN), pp. 37-40 (2004)
12. Kuhn, F., Moscibroda, T., Nieberg, T., Wattenhofer, R.: Fast deterministic distributed maximal independent set computation on growth-bounded graphs. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 273-287. Springer, Heidelberg (2005)
13. Kuhn, F., Moscibroda, T., Nieberg, T., Wattenhofer, R.: Local Approximation Schemes for Ad Hoc and Sensor Networks. In: 3rd ACM Joint Workshop on Foundations of Mobile Computing (DIALM-POMC). ACM Press, New York (2005)
14. Kuhn, F., Wattenhofer, R., Zollinger, A.: Ad-Hoc Networks Beyond Unit Disk Graphs. In: 1st ACM Joint Workshop on Foundations of Mobile Computing (DIALM-POMC). ACM Press, New York (2003)
15. Linial, N.: Locality in distributed graph algorithms. SIAM Journal on Computing 21(1), 193-201 (1992)
16. Nieberg, T., Hurink, J.L.: A PTAS for the minimum dominating set problem in unit disk graphs. Memorandum 1732, University of Twente, Enschede (2004)
17. Nieberg, T., Hurink, J.L.: Wireless communication graphs. In: Proceedings of DEST Intern. Workshop on Signal Processing for Sensor Networks, ISSNIP'04, pp. 367-372 (2004)
18. Panchard, J., Rao, S., Prabhakar, T., Jamadagni, H., Hubaux, J.-P.: COMMON-Sense Net: Improved Water Management for Resource-Poor Farmers via Sensor Networks. In: Intern. Conference on Communication and Information Technologies and Development ICTD (2006)
19. Parthasarathy, S., Gandhi, R.: Distributed algorithms for coloring and domination in wireless ad hoc networks. In: Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pp. 447-459 (2004)