Abstract
We present 1 − ε approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is local in the sense that whether or not an edge is in the matching depends only on other vertices which are at most a constant number of hops away from it. The algorithm for growth-bounded graphs needs at most \(O\left(\log\triangle\log^{*}n\right.+\) \(\left.\frac{1}{\epsilon}^{O(1)}\cdot\log^{*}n\right)\) communication rounds during its execution. Using these matching algorithms we can compute vertex covers of the respective graph classes whose size are at most twice the optimal.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bar-Yehuda, R., Even, S.: A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics 25, 27–45 (1985)
Barrière, L., Fraigniaud, P., Narayanan, L.: Robust position-based routing in wireless ad hoc networks with unstable transmission ranges. In: DIAL-M, pp. 19–27. ACM Press, New York (2001)
Borbash, S.A., Ephremides, A.: The feasibility of matchings in a wireless network. IEEE/ACM Transactions on Networking 14(SI), 2749–2755 (2006)
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, 2002, pp. 33–42. ACM Press, New York (2002)
Edmonds, J.: Paths, trees, and flowers. Canadian J. Math. 17, 449–467 (1965)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the theory of NP-completeness. Freeman, NY (1979)
Hopcroft, J.E., Karp, R.M.: An n 5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing 2(4), 225–231 (1973)
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)
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)
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)
Linial, N.: Locality in distributed graph algorithms. SIAM J. Comput. 21(1), 193–201 (1992)
Tassiulas, L., Sarkar, S.: Maxmin fair scheduling in wireless networks. In: Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Society (INFOCOM 2002), Piscataway, NJ, USA, June 23–27, 2002, vol. 2, pp. 763–772. IEEE Computer Society, Los Alamitos (2002)
Wiese, A., Kranakis, E.: Impact of locality on location aware unit disk graphs. Technical Report TR-07-21, Carleton University, School of Computer Science, Ottawa (December 2007)
Wiese, A., Kranakis, E.: Local PTAS for Independent Set and Vertex Cover in Location Aware UDGs. In: Nikoletseas, S.E., Chlebus, B.S., Johnson, D.B., Krishnamachari, B. (eds.) DCOSS 2008. LNCS, vol. 5067. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wiese, A., Kranakis, E. (2008). Local Maximal Matching and Local 2-Approximation for Vertex Cover in UDGs. In: Coudert, D., Simplot-Ryl, D., Stojmenovic, I. (eds) Ad-hoc, Mobile and Wireless Networks. ADHOC-NOW 2008. Lecture Notes in Computer Science, vol 5198. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85209-4_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-85209-4_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85208-7
Online ISBN: 978-3-540-85209-4
eBook Packages: Computer ScienceComputer Science (R0)