Distributed weighted matching

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

Volumn 3274, Issue , 2004, Pages 335-348

  Wattenhofer, Mirjam ^a   Wattenhofer, Roger ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; FORESTRY; GRAPH ALGORITHMS;

APPROXIMATION RATIOS; CONSTANT RATIO; POLYLOGARITHMIC TIME; TIME COMPLEXITY; TREE ALGORITHMS; WEIGHTED GRAPH; WEIGHTED MATCHING; WEIGHTED TREE;

TREES (MATHEMATICS);

EID: 35048893497     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30186-8_24     Document Type: Article

References (14)

1. [CHS02] S. Chattopadhyay, L. Higham, and K. Seyffarth. Dynamic and self-stabilizing distributed matching. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 290-297. ACM Press, 2002.
2. [CV86] R. Cole and U. Vishkin. Deterministic coin tossing with applications to optimal parallel list ranking. Information and Control, 70(l):32-53, 1986.
3. [Edm65] J. Edmonds. Paths, trees and flowers. Canadian Journal of Mathematics, 17:449-467, 1965.
4. [HKP01] M. Hanckowiak, M. Karonski, and A. Panconesi. On the distributed complexity of computing maximal matchings. SIAM Journal on Discrete Mathematics, 15(1):41-57,2001.
5. [II86] A. Israeli and A. Itai. A fast and simple randomized parallel algorithm for maximal matching. Information Processing Letters, 22:77-80, 1986.
6. [JRS01] L. Jia, R. Rajaraman, and T. Suel. An efficient distributed algorithm for constructing small dominating sets. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 33-42, 2001.
7. [KMW04] F. Kuhn, T. Moscibroda, and R. Wattenhofer. Lower and upper bounds for distributed packing and covering. Technical report, ETH Zurich, Dept. of Computer Science, 2004.
8. [KS00] M. Karaata and K. Saleh. A distributed self-stabilizing algorithm for finding maximal matching. Computer Systems Science and Engineering, 3:175-180, 2000.
9. [KVY94] S. Khuller, U. Vishkin, and N. Young. A primal-dual parallel approximation technique applied to weighted set and vertex covers. Journal of Algorithms, 17(2):280-289, 1994.
10. [KW03] F. Kuhn and R. Wattenhofer. Constant-time distributed dominating set approximation. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (PODC),2003.
11. [Lin92] N. Linial. Locality in distributed graph algorithms. SIAM Journal on Computing, 21:193-201, 1992.
12. [Lub86] M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAM Journal on Computing, 15:1036-1053, 1986.
13. [Pel00] D. Peleg. Distributed Computing, A Locality-Sensitive Approach. SIAM, 2000
14. [UC00] R. Uehara and Z. Chen. Parallel approximation algorithms for maximum weighted matching in general graphs. Information Processing Letters, 76:13-17, 2000.