Distributed approximation algorithms for weighted problems in minor-closed families

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

Volumn 4598 LNCS, Issue , 2007, Pages 515-525

  Czygrinow, A ^a   Hanckowiak M ^b  

^a ARIZONA STATE UNIVERSITY   (United States)

^b ADAM MICKIEWICZ UNIVERSITY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; GRAPH THEORY; PROBLEM SOLVING;

DISTRIBUTED ALGORITHM;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 37849012346     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73545-8_50     Document Type: Conference Paper

References (12)

1. 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 (FOCS), pp. 364-369. IEEE Computer Society Press, Los Alamitos (1989)
2. Czygrinow, A., Hańćkowiak, M.: Distributed algorithms for weighted problems in sparse graphs. Journal of Discrete Algorithms 4(4), 588-607 (2006)
3. 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)
4. 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)
5. Diestel, R.: Graph Theory, 3rd edn. Springer, Heidelberg (2005)
6. Elkin, M.: An Overview of Distributed Approximation. In ACM SIGACT News Distributed Computing Column. 35(4,132), 40-57 (2004)
7. 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)
8. Kuhn, F., Moscibroda, T., Wattenhofer, R.: What Cannot Be Computed Locally! In: Proceedings of 23rd ACM Symposium on the Principles of Distributed Computing (PODC), pp. 300-309. ACM Press, New York (2004)
9. Kutten, S., Peleg, D.: Fast distributed construction of k-dominating sets and applications. In: Proceedings of the 14th ACM symposium on Principles of Distributed Computing (PODC), pp. 238-251. ACM Press, New York (1995)
10. Linial, N.: Locality in distributed graph algorithms. SIAM Journal on Computing 21(1), 193-201 (1992)
11. Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM Journal on Computing 15(4), 1036-1053 (1986)
12. 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)