@inproceedings{11ab29a5f9b14330bb7f088710d7b5ba,
title = "Efficient distributed weighted matchings on trees",
abstract = "In this paper, we study distributed algorithms to compute a weighted matching that have constant (or at least sub-logarithmic) running time and that achieve approximation ratio 2 + ε or better. In fact we present two such synchronous algorithms, that work on arbitrary weighted trees. The first algorithm is a randomised distributed algorithm that computes a weighted matching of an arbitrary weighted tree, that approximates the maximum weighted matching by a factor 2 + ε. The running time is O(1). The second algorithm is deterministic, and approximates the maximum weighted matching by a factor 2 + ε, but has running time O(log* |V|). Our algorithms can also be used to compute maximum unweighted matchings on regular and almost regular graphs within a constant approximation.",
author = "Hoepman, {Jaap Henk} and Shay Kutten and Zvi Lotker",
year = "2006",
month = jan,
day = "1",
doi = "10.1007/11780823_10",
language = "English",
isbn = "3540354743",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "115--129",
booktitle = "Structural Information and Communication Complexity - 13th International Colloquium, SIROCCO 2006, Proceedings",
address = "Germany",
note = "13th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2006 ; Conference date: 02-07-2006 Through 05-07-2006",
}