Skip to main content
Journal Article

Distributed weighted matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 3274 335-348
DOI: 10.1007/978-3-540-30186-8_24
59Citations
Citations of this article
51Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximation ratio of the tree algorithm is constant. In particular, the approximation ratio is 4. For the general graph algorithm we prove a constant ratio bound of 5 and a polylogarithmic time complexity of O(log2 n). ©Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Wattenhofer, M., & Wattenhofer, R. (2004). Distributed weighted matching. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3274, 335–348. https://doi.org/10.1007/978-3-540-30186-8_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free