Distributed algorithms for weighted problems in sparse graphs

Journal of Discrete Algorithms

Volumn 4, Issue 4, 2006, Pages 588-607

  Czygrinow, A ^a   Hanckowiak M ^b  

^a ARIZONA STATE UNIVERSITY   (United States)

^b ADAM MICKIEWICZ UNIVERSITY   (Poland)

Author keywords

Approximation algorithms; Distributed algorithms; Maximum weight matching; Minimum weight dominating set; Minimum weight independent set

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; AUTOMATA THEORY; GRAPH THEORY; OPTIMIZATION; TREES (MATHEMATICS);

APPROXIMATION ALGORITHMS; DISTRIBUTED ALGORITHMS; MAXIMUM WEIGHT MATCHING; MINIMUM WEIGHT DOMINATING SETS; MINIMUM WEIGHT INDEPENDENT SETS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33750612561     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2005.07.006     Document Type: Article

References (11)

1. B. Awerbuch, A.V. Goldberg, M. Luby, S.A. Plotkin, Network decomposition and locality in distributed computation, in: Proc. 30th IEEE Symp. on Foundations of Computer Science, 1989, pp. 364-369
2. Cole R., and Vishkin U. Deterministic coin tossing with applications to optimal parallel list ranking. Information and Control 70 (1986) 32-53
3. Czygrinow A., and Hańćkowiak M. Distributed algorithm for better approximation of the maximum matching. COCOON 2003. Lecture Notes in Comput. Sci. vol. 2697 (2003), Springer, Berlin 242-251
4. Czygrinow A., Hańćkowiak M., and Szymańska E. Distributed algorithm for approximating the maximum matching. Discrete Appl. Math. 143 1-3 (2004) 62-71
5. Czygrinow A., Hańćkowiak M., and Szymańska E. A fast distributed algorithm for approximating the maximum matching. Algorithms-ESA 2004. Lecture Notes in Comput. Sci. vol. 3221 (2004), Springer, Berlin 252-263
6. Elkin M. Distributed approximation-a survey. ACM SIGACT News 35 4 (2004) 3-18
7. Jia L., Rajaramam R., and Suel T. An efficient distributed algorithm for constructing small dominating sets. Distrib. Comput. 15 (2002) 193-205
8. F. Kuhn, R. Wattenhofer, Constant-time distributed dominating set approximation, in: Proc. of the 22nd ACM Symp. on Principles of Distributed Computing, 2003, pp. 25-32
9. S. Kutten, D. Peleg, Fast distributed construction of k-dominating sets and applications, in: Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995, pp. 238-251
10. Linial N. Locality in distributed graph algorithms. SIAM J. Comput. 21 1 (1992) 193-201
11. M. Wattenhofer, R. Wattenhofer, Distributed weighted matching, in: DISC, Distributed Computing, 18th International Conference, Amsterdam, 2004, pp. 335-348