An approximation algorithm for the exact matching problem in bipartite graphs

DOI10.4230/LIPICS.APPROX/RANDOM.2023.18MaRDI QIDQ6663029zbMATH OpenFDO

Authors Anita Dürr, Nicolas El Maalouly, Lasse Wulf

Publication date 14 January 2025

Full work available at URL https://doi.org/10.4230/LIPICS.APPROX/RANDOM.2023.18

zbMATH Keywords

approximation algorithmsbounded color matchingexact matchingperfect matchingred-blue matching

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Cited in

(2)

• On the exact matching problem in dense graphs
• On finding -th smallest perfect matchings

This page was built for publication: An approximation algorithm for the exact matching problem in bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6663029)