一种适用于广泛 Max-SMTI 问题的简单 1.5-近似算法
A Simple 1.5-Approximation Algorithm for a Wide Range of Max-SMTI Problems
AI总结:
本文提出一种简单的1.5-近似算法,统一处理带平局最大稳定匹配问题的多种推广,包括关键顶点、自由边和Δ-稳定性,并利用边复制技术简化算法与分析,同时回答了带自由边MAX-SMTI问题是否存在3/2-近似算法的开放问题。
摘要:
我们针对带平局的最大规模稳定匹配问题的许多已有扩展给出了一种简单的近似算法,这些扩展的共同推广包括:图中存在关键顶点,我们必须尽可能多地在这些顶点之间进行匹配;自由边,它们不能成为阻塞边;以及 Δ-稳定性,这意味着一条边要构成阻塞,其改进在一边或两边都必须足够大。我们还引入了其他概念以进一步推广这些情形,从而使我们的框架能够涵盖许多现有和未来的应用。我们表明,边复制技术使我们能够同时处理这些不同类型的推广,同时使算法、证明和分析比以往方法简单得多、简短得多。特别地,我们回答了 Askalidis 等人(2013)提出的一个开放问题,即关于带自由边的 MAX-SMTI 问题是否存在 3/2-近似算法。这表明该技术能够很好地把握这些问题的内在本质,并具有解决许多未来应用的潜力。
英文摘要:
We give a simple approximation algorithm for a common generalization of many previously studied extensions of the maximum size stable matching problem with ties. These generalizations include the existence of critical vertices in the graph, amongst whom we must match as much as possible, free edges, that cannot be blocking edges and $Δ$-stabilities, which mean that for an edge to block, the improvement should be large enough on one or both sides. We also introduce other notions to generalize these even further, which allows our framework to capture many existing and future applications. We show that the edge duplicating technique allows us to treat these different types of generalizations simultaneously, while also making the algorithm, the proofs and the analysis much simpler and shorter than in previous approaches. In particular, we answer an open question by Askalidis et al. (2013) about the existence of a $\frac{3}{2}$-approximation algorithm for the MAX-SMTI problem with free edges. This demonstrates that this technique can grasp the underlying essence of these problems quite well and have the potential to be able to solve many future applications.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。