Local PTAS for independent set and vertex cover in location aware unit disk graphs (Extended Abstract)

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

Volumn 5067 LNCS, Issue , 2008, Pages 415-431

  Wiese, Andreas ^a   Kranakis, Evangelos ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; DETECTORS; DISKS (STRUCTURAL COMPONENTS); GRAPH THEORY; POLYNOMIAL APPROXIMATION; SENSORS; SET THEORY; TELECOMMUNICATION NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

APPROXIMATION RATIOS; DISTRIBUTED COMPUTING; GEOGRAPHIC COORDINATES; GRAPH MODELING; HEIDELBERG (CO); IN ORDER; INDEPENDENT SETS; INTERNATIONAL CONFERENCES; LOCAL APPROXIMATION; LOCATION-AWARE; MAXIMUM INDEPENDENT SET (MIS); MINIMUM VERTEX COVERS; NUMBER OF HOPS; PROCESSING TIME; SENSOR SYSTEMS; SINGLE VERTEX; SPRINGER (CO); UNIT DISK GRAPH (UDG); UPPER BOUNDS; VERTEX COVER;

APPROXIMATION ALGORITHMS;

EID: 45849086914     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69170-9_28     Document Type: Conference Paper

References (16)

1. Bar-Yehuda, R., Even, S.: A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics 25, 27-45 (1985)
2. Basagni, S.: Finding a maximal weighted independent set in wireless networks. Telecommunication Systems 18(1-3), 155-168 (2001)
3. Breu, H., Kirkpatrick, D.G.: Unit disk graph recognition is NP-hard. Computational Geometry. Theory and Applications 9(1-2), 3-24 (1998)
4. Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Math 86(1-3), 165-177 (1990)
5. Czyzowicz, J., Dobrev, S., Fevens,T., González-Aguilar, H.,Kranakis, E., Opatrny, J., Urrutia, J.: Local algorithms for dominating and connected dominating sets of unit disc graphs with location aware nodes. In: Proceedings of LATIN 2008. LNCS, vol. 4957 (2008)
6. Dinur, I., Safra, S.: The importance of being biased. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC 2002), May 19-21, 2001, pp. 33-42. ACM Press, New York (2002)
7. Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness (1979)
8. 1ε. Electronic Colloquium on Computational Complexity (ECCC) 4(38) (1997)
9. 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)
10. Kuhn, F., Moscibroda, T., Wattenhofer, R.: Unit disk graph approximation. In: DIALM-POMC 2004: Proceedings of the 2004 joint workshop on Foundations of mobile computing, pp. 17-23. ACM Press, New York (2004)
11. Kuhn, F., Nieberg, T., Moscibroda, T., Wattenhofer, R.: Local approximation schemes for ad hoc and sensor networks. In: DIALM-POMC 2005: Proceedings of the 2005 joint workshop on Foundations of mobile computing, pp. 97-103. ACM Press, New York (2005)
12. Marathe, M.V., Breu, H., Hunt III, H.B., Ravi, S.S., Rosenkrantz, D.J.: Simple heuristics for unit disk graphs. Networks 25(1), 59-68 (1995)
13. Nieberg, T., Hurink, J.L.: A PTAS for the minimum dominating set problem in unit disk graphs. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol. 3879, pp. 296-306. Springer, Heidelberg (2006)
14. Nieberg, T., Hurink, J.L., Kern, W.: A robust PTAS for maximum weight independent sets in unit disk graphs. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 214-221. Springer, Heidelberg (2004)
15. Wiese, A., Kranakis, E.: Local PTAS for Dominating and Connected Dominating Set in Location Aware UDGs (to appear, 2007)
16. Wu, J., Li, H.: On calculating connected dominating set for efficient routing in ad hoc wireless networks. In: DIAL-M, pp. 7-14. ACM, New York (1999)