Efficient distributed weighted matchings on trees

Jaap Henk Hoepman, Shay Kutten, Zvi Lotker

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

12 Scopus citations

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.

Original languageEnglish
Title of host publicationStructural Information and Communication Complexity - 13th International Colloquium, SIROCCO 2006, Proceedings
PublisherSpringer Verlag
Pages115-129
Number of pages15
ISBN (Print)3540354743, 9783540354741
DOIs
StatePublished - 2006
Externally publishedYes
Event13th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2006 - Chester, United Kingdom
Duration: 2 Jul 20065 Jul 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4056 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference13th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2006
Country/TerritoryUnited Kingdom
CityChester
Period2/07/065/07/06

Fingerprint

Dive into the research topics of 'Efficient distributed weighted matchings on trees'. Together they form a unique fingerprint.

Cite this