On maximum bipartite matching with separation

IF 0.7 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Information Processing Letters Pub Date : 2023-08-01 DOI:10.1016/j.ipl.2023.106388

Pasin Manurangsi , Erel Segal-Halevi , Warut Suksompong

引用次数: 0

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.

查看原文本刊更多论文

关于带分离的最大二部匹配

最大二分匹配是一个可以在多项式时间内求解的基本算法问题。我们考虑一个存在分离约束的自然变体：一侧的顶点位于路径或网格上，并且不允许同时匹配两个彼此靠近的顶点。我们证明了该问题即使对于路径也很难近似，并为路径和网格提供了常因子近似算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Information Processing Letters 工程技术-计算机：信息系统

CiteScore

1.80

自引率

0.00%

发文量

审稿时长

7.3 months

期刊介绍： Information Processing Letters invites submission of original research articles that focus on fundamental aspects of information processing and computing. This naturally includes work in the broadly understood field of theoretical computer science; although papers in all areas of scientific inquiry will be given consideration, provided that they describe research contributions credibly motivated by applications to computing and involve rigorous methodology. High quality experimental papers that address topics of sufficiently broad interest may also be considered. Since its inception in 1971, Information Processing Letters has served as a forum for timely dissemination of short, concise and focused research contributions. Continuing with this tradition, and to expedite the reviewing process, manuscripts are generally limited in length to nine pages when they appear in print.