On maximum bipartite matching with separation

Pasin Manurangsi, Erel Segal-Halevi, Warut Suksompong

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


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
StatePublished - Aug 2023


  • Approximation algorithms
  • Bipartite matching
  • Separation constraint


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

Cite this