Abstract
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed families. To complement these results we indicate that no efficient distributed algorithm for the minimum weight connected dominating set exists.
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: FOCS. Proc. 30th IEEE Symp. on Foundations of Computer Science, pp. 364–369. IEEE Computer Society Press, Los Alamitos (1989)
Czygrinow, A., Hańćkowiak, M.: Distributed algorithms for weighted problems in sparse graphs. Journal of Discrete Algorithms 4(4), 588–607 (2006)
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., Szymańska, E.: Distributed approximation algorithms in planar graphs, 6th Conference on Algorithms and Complexity (CIAC). 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)
Elkin, M.: An Overview of Distributed Approximation. In ACM SIGACT News Distributed Computing Column. 35(4,132), 40–57 (2004)
Kuhn, F., Wattenhofer, R.: Constant-Time Distributed Dominating Set Approximation. 22nd ACM Symposium on the Principles of Distributed Computing (PODC), pp. 25–32. ACM Press, New York (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. ACM Press, New York (2004)
Kutten, S., Peleg, D.: Fast distributed construction of k-dominating sets and applications. In: PODC. Proceedings of the 14th ACM symposium on Principles of Distributed Computing, pp. 238–251. ACM Press, New York (1995)
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 Journal on Computing 15(4), 1036–1053 (1986)
Nesetril, J., de Mendez, P.O.: Colorings and homomorphisms of minor closed classes. In: Aronov, B., Basu, S., Pach, J., Sharir, M. (eds.) Discrete and Computational Geometry, The Goodman-Pollack Festschrift. Algorithms and Combinatorics, vol. 25, pp. 651–664. Springer, Heidelberg (2003)
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 Approximation Algorithms for Weighted Problems in Minor-Closed Families. In: Lin, G. (eds) Computing and Combinatorics. COCOON 2007. Lecture Notes in Computer Science, vol 4598. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73545-8_50
Download citation
DOI: https://doi.org/10.1007/978-3-540-73545-8_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73544-1
Online ISBN: 978-3-540-73545-8
eBook Packages: Computer ScienceComputer Science (R0)