Skip to Main content Skip to Navigation
Reports

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

https://hal.inria.fr/hal-00739360
Contributor : Bora Uçar <>
Submitted on : Monday, October 8, 2012 - 9:47:56 AM
Last modification on : Friday, November 20, 2020 - 4:22:03 PM
Long-term archiving on: : Friday, December 16, 2016 - 9:46:14 PM

File

rr-8093.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00739360, version 1

Collections

Citation

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

Share

Metrics

Record views

54

Files downloads

301