License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ISAAC.2021.59
URN: urn:nbn:de:0030-drops-154925
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/15492/
Czygrinow, Andrzej ;
Hanćkowiak, Michał ;
Witkowski, Marcin
Distributed Approximations of f-Matchings and b-Matchings in Graphs of Sub-Logarithmic Expansion
Abstract
We give a distributed algorithm which given ε > 0 finds a (1-ε)-factor approximation of a maximum f-matching in graphs G = (V,E) of sub-logarithmic expansion. Using a similar approach we also give a distributed approximation of a maximum b-matching in the same class of graphs provided the function b: V → ℤ^+ is L-Lipschitz for some constant L. Both algorithms run in O(log^* n) rounds in the LOCAL model, which is optimal.
BibTeX - Entry
@InProceedings{czygrinow_et_al:LIPIcs.ISAAC.2021.59,
author = {Czygrinow, Andrzej and Han\'{c}kowiak, Micha{\l} and Witkowski, Marcin},
title = {{Distributed Approximations of f-Matchings and b-Matchings in Graphs of Sub-Logarithmic Expansion}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {59:1--59:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/15492},
URN = {urn:nbn:de:0030-drops-154925},
doi = {10.4230/LIPIcs.ISAAC.2021.59},
annote = {Keywords: Distributed algorithms, f-matching, b-matching}
}
|
Keywords: |
|
Distributed algorithms, f-matching, b-matching |
|
Collection: |
|
32nd International Symposium on Algorithms and Computation (ISAAC 2021) |
|
Issue Date: |
|
2021 |
|
Date of publication: |
|
30.11.2021 |
