Engineering fast algorithms for the bottleneck matching problem - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Engineering fast algorithms for the bottleneck matching problem

Résumé

We investigate the maximum bottleneck matching problem in bipartite graphs. Given a bipartite graph with nonnegative edge weights, the problem is to determine a maximum cardinality matching in which the minimum weight of an edge is the maximum. To the best of our knowledge, there are two widely used solvers for this problem based on two different approaches. There exists a third known approach in the literature, which seems inferior to those two which is presumably why there is no implementation of it. We take this third approach, make theoretical observations to improve its behavior, and implement the improved method. Experiments with the existing two solvers show that their run time can be too high to be useful in many interesting cases. Furthermore, their performance is not predictable, and slight perturbations of the input graph lead to considerable changes in the run time. On the other hand, the proposed solver's performance is much more stable; it is almost always faster than or comparable to the two existing solvers, and its run time always remains low.
Fichier principal
Vignette du fichier
bottleMatchingLIPICS.pdf (580.54 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04146298 , version 1 (29-06-2023)
hal-04146298 , version 2 (14-09-2023)

Licence

Paternité

Identifiants

  • HAL Id : hal-04146298 , version 2

Citer

Ioannis Panagiotas, Grégoire Pichon, Somesh Singh, Bora Uçar. Engineering fast algorithms for the bottleneck matching problem. ESA 2023 - The 31st Annual European Symposium on Algorithms, Sep 2023, Amsterdam (Hollande), Netherlands. ⟨hal-04146298v2⟩
80 Consultations
198 Téléchargements

Partager

Gmail Facebook X LinkedIn More