Abstract
We give a distributed approximation algorithm for the vertex-packing problem in unit-disk graphs. Given a graph H, the algorithm finds in a unit-disk graph G a collection of pairwise disjoint copies of H of size which is approximately equal to the packing number of H in G. The algorithm is deterministic and runs in a poly-logarithmic number of rounds in the message passing model.
This work was supported by grant N206 017 32/2452 for years 2007-2010.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Awerbuch, B., Goldberg, A.V., Luby, M., Plotkin, S.A.: Network Decomposition and Locality in Distributed Computation. In: Proc. 30th IEEE Symp. on Foundations of Computer Science, pp. 364–369 (1989)
Czygrinow, A., Hańćkowiak, M.: Distributed almost exact approximations for minor-closed families. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 244–255. Springer, Heidelberg (2006)
Czygrinow, A., Hańćkowiak, M.: Distributed approximation algorithms in unit disc graphs. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 385–398. Springer, Heidelberg (2006)
Czygrinow, A., Hańćkowiak, M., Szymańska, E.: Distributed approximation algorithms in planar graphs. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol. 3998, pp. 296–307. Springer, Heidelberg (2006)
Diestel, R.: Graph Theory, 3rd edn. Springer, Heidelberg (2005)
Dai, F., Wu, J.: An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks. IEEE Transactions on Parallel and Distributed Systems 15(10), 908–920 (2004)
Dubhashi, D., Mei, A., Panconesi, A., Radhakrishnan, J., Srinivasan, A.: Fast Distributed Algorithms for (Weakly) Connected Dominating Sets and Linear-Size Skeletons. In: SODA. Proc. of the ACM-SIAM Symposium on Discrete Algorithms, pp. 717–724 (2003)
Kuhn, F., Moscibroda, T., Wattenhofer, R.: What Cannot Be Computed Locally! In: PODC. Proceedings of 23rd ACM Symposium on the Principles of Distributed Computing, pp. 300–309 (2004)
Kuhn, F., Moscibroda, T., Wattenhofer, R.: On the Locality of Bounded Growth. In: PODC. 24th ACM Symposium on the Principles of Distributed Computing, Las Vegas, Nevada, USA, pp. 60–68 (2005)
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., 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), Cologne, Germany, pp. 97–103 (2005)
Linial, N.: Locality in distributed graph algorithms. SIAM Journal on Computing 21(1), 193–201 (1992)
Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15(4), 1036–1053 (1986)
Panconesi, A., Rizzi, R.: Some Simple Distributed Algorithms for Sparse Networks. Distributed Computing 14, 97–100 (2001)
Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Czygrinow, A., Hańćkowiak, M. (2007). Distributed Approximations for Packing in Unit-Disk Graphs. In: Pelc, A. (eds) Distributed Computing. DISC 2007. Lecture Notes in Computer Science, vol 4731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75142-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-75142-7_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75141-0
Online ISBN: 978-3-540-75142-7
eBook Packages: Computer ScienceComputer Science (R0)