On maximum bipartite matching with separation

Pasin Manurangsi, Erel Segal-Halevi, Warut Suksompong

Research output: Contribution to journalArticlepeer-review

Abstract

Maximum bipartite matching is a fundamental algorithmic problem which can be solved in polynomial time. We consider a natural variant in which there is a separation constraint: the vertices on one side lie on a path or a grid, and two vertices that are close to each other are not allowed to be matched simultaneously. We show that the problem is hard to approximate even for paths, and provide constant-factor approximation algorithms for both paths and grids.

Original languageEnglish
Article number106388
JournalInformation Processing Letters
Volume182
DOIs
StatePublished - Aug 2023
Externally publishedYes

Bibliographical note

Publisher Copyright:
© 2023 The Author(s)

Keywords

  • Approximation algorithms
  • Bipartite matching
  • Separation constraint

Fingerprint

Dive into the research topics of 'On maximum bipartite matching with separation'. Together they form a unique fingerprint.

Cite this