On maximum bipartite matching with separation

Pasin Manurangsi; Erel Segal-Halevi; Warut Suksompong

doi:10.1016/j.ipl.2023.106388

On maximum bipartite matching with separation

Pasin Manurangsi, Erel Segal-Halevi, Warut Suksompong

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

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 language	English
Article number	106388
Journal	Information Processing Letters
Volume	182
DOIs	https://doi.org/10.1016/j.ipl.2023.106388
State	Published - Aug 2023
Externally published	Yes

Bibliographical note

Publisher Copyright:
© 2023 The Author(s)

Funding

This work was partially supported by the Israel Science Foundation under grant number 712/20 , by the Singapore Ministry of Education under grant number MOE-T2EP20221-0001 , and by an NUS Start-up Grant. We are grateful to Jérôme Lang, Joe Briggs, Anton Petrunin, Saul Rodriguez Martin, and Noam D. Elkies for their helpful ideas.

Funders	Funder number
National University of Singapore
Ministry of Education - Singapore	MOE-T2EP20221-0001
Israel Science Foundation	712/20

Keywords

Approximation algorithms
Bipartite matching
Separation constraint

Access to Document

10.1016/j.ipl.2023.106388

Cite this

@article{8b9d2e74a08a4879bc8d7f02ebb7e4e7,

title = "On maximum bipartite matching with separation",

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.",

keywords = "Approximation algorithms, Bipartite matching, Separation constraint",

author = "Pasin Manurangsi and Erel Segal-Halevi and Warut Suksompong",

note = "Publisher Copyright: {\textcopyright} 2023 The Author(s)",

year = "2023",

month = aug,

doi = "10.1016/j.ipl.2023.106388",

language = "אנגלית",

volume = "182",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - On maximum bipartite matching with separation

AU - Manurangsi, Pasin

AU - Segal-Halevi, Erel

AU - Suksompong, Warut

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 -

On maximum bipartite matching with separation

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this