Distributed Approximations of f-Matchings and b-Matchings in Graphs of Sub-Logarithmic Expansion

Andrzej Czygrinow, Michał Hanćkowiak, Marcin Witkowski

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 → Z+ is L-Lipschitz for some constant L. Both algorithms run in O(log n) rounds in the LOCAL model, which is optimal.

Original languageEnglish (US)
Title of host publication32nd International Symposium on Algorithms and Computation, ISAAC 2021
EditorsHee-Kap Ahn, Kunihiko Sadakane
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959772143
DOIs
StatePublished - Dec 1 2021
Event32nd International Symposium on Algorithms and Computation, ISAAC 2021 - Fukuoka, Japan
Duration: Dec 6 2021Dec 8 2021

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume212
ISSN (Print)1868-8969

Conference

Conference32nd International Symposium on Algorithms and Computation, ISAAC 2021
Country/TerritoryJapan
CityFukuoka
Period12/6/2112/8/21

Keywords

  • B-matching
  • Distributed algorithms
  • F-matching

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'Distributed Approximations of f-Matchings and b-Matchings in Graphs of Sub-Logarithmic Expansion'. Together they form a unique fingerprint.

Cite this