Skip to Main content Skip to Navigation

Investigations on push-relabel based algorithms for the maximum transversal problem

Abstract : We investigate the push-relabel algorithm for solving the problem of finding a maximum cardinality matching in a bipartite graph in the context of the maximum transversal problem. We describe in detail an optimized yet easy-to-implement version of the algorithm and fine-tune its parameters. We also introduce new performance-enhancing techniques. On a wide range of real-world instances, we compare the push-relabel algorithm with state-of-the-art augmenting path-based algorithms and the recently proposed pseudoflow approach. We conclude that a carefully tuned push-relabel algorithm is competitive with all known augmenting path-based algorithms, and superior to the pseudoflow-based ones.
Complete list of metadata
Contributor : Bora Uçar Connect in order to contact the contributor
Submitted on : Wednesday, October 31, 2012 - 12:59:01 PM
Last modification on : Monday, May 16, 2022 - 4:46:02 PM
Long-term archiving on: : Saturday, December 17, 2016 - 6:56:43 AM


Files produced by the author(s)


  • HAL Id : hal-00739360, version 3


Kamer Kaya, Johannes Langguth, Fredrik Manne, Bora Uçar. Investigations on push-relabel based algorithms for the maximum transversal problem. [Research Report] RR-8093, INRIA. 2012, pp.27. ⟨hal-00739360v3⟩



Record views


Files downloads