An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs

Anita Dürr, Nicolas El Maalouly, Lasse Wulf. An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs. In Nicole Megow, Adam Smith, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA. Volume 275 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. [doi]

@inproceedings{DurrMW23,
  title = {An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs},
  author = {Anita Dürr and Nicolas El Maalouly and Lasse Wulf},
  year = {2023},
  doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.18},
  url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.18},
  researchr = {https://researchr.org/publication/DurrMW23},
  cites = {0},
  citedby = {0},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA},
  editor = {Nicole Megow and Adam Smith},
  volume = {275},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  isbn = {978-3-95977-296-9},
}