TY - JOUR
T1 - On maximum bipartite matching with separation
AU - Manurangsi, Pasin
AU - Segal-Halevi, Erel
AU - Suksompong, Warut
N1 - Publisher Copyright:
© 2023 The Author(s)
PY - 2023/8
Y1 - 2023/8
N2 - 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.
AB - 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.
KW - Approximation algorithms
KW - Bipartite matching
KW - Separation constraint
UR - http://www.scopus.com/inward/record.url?scp=85150188332&partnerID=8YFLogxK
U2 - 10.1016/j.ipl.2023.106388
DO - 10.1016/j.ipl.2023.106388
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:85150188332
SN - 0020-0190
VL - 182
JO - Information Processing Letters
JF - Information Processing Letters
M1 - 106388
ER -