Fully-dynamic Weighted Matching Approximation in Practice - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2021

Fully-dynamic Weighted Matching Approximation in Practice

Abstract

Finding large or heavy matchings in graphs is a ubiquitous combinatorial optimization problem. In this paper, we engineer the first non-trivial implementations for approximating the dynamic weighted matching problem. Our first algorithm is based on random walks/paths combined with dynamic programming. The second algorithm has been introduced by Stubbs and Williams without an implementation. Roughly speaking, their algorithm uses dynamic unweighted matching algorithms as a subroutine (within a multilevel approach); this allows us to use previous work on dynamic unweighted matching algorithms as a black box in order to obtain a fully-dynamic weighted matching algorithm. We empirically study the algorithms on an extensive set of dynamic instances and compare them with optimal weighted matchings. Our experiments show that the random walk algorithm typically fares much better than Stubbs/Williams (regarding the time/quality tradeoff), and its results are often not far from the optimum.
Fichier principal
Vignette du fichier
paper.pdf (743.76 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03210915 , version 1 (28-04-2021)

Identifiers

Cite

Eugenio Angriman, Henning Meyerhenke, Christian Schulz, Bora Uçar. Fully-dynamic Weighted Matching Approximation in Practice. ACDA 2021 - SIAM Conference on Applied and Computational Discrete Algorithms, SIAM, Jul 2021, Virtual, France. ⟨10.1137/1.9781611976830.4⟩. ⟨hal-03210915⟩
67 View
308 Download

Altmetric

Share

Gmail Facebook X LinkedIn More