基于随机贪心独立集的匹配算法：更简单的算法与分析
Matchings via Random Greedy Independent Set: A Simpler Algorithm and Analysis
浏览论文内容
中文总结 AI 辅助
本文提出一种简化的随机贪心独立集扩展算法，用于求解最大匹配问题，其分析无需涉及分数匹配，能更简洁直接地证明近似比。
中文摘要 AI 辅助
我们证明，随机贪心极大独立集算法的简单扩展可得到最大匹配问题的常数近似算法。该算法是Assadi等人[JACM 2026]用于动态设置（边可插入和删除）下数据流处理的算法的简化版。与之前的工作不同，我们的分析无需考虑分数匹配，能为该基础算法的近似比提供更短、更直接的证明。
英文摘要
We show that a simple extension of the randomized greedy maximal independent set algorithm yields a constant approximation for the maximum matching problem. The algorithm is a simplification of an algorithm used by Assadi et al. [JACM 2026] in the context of processing data streams in the dynamic setting where edges may be inserted and deleted. In contrast to the previous work, our analysis avoids consideration of fractional matchings and yields a significantly shorter and more direct proof of the approximation factor for the basic algorithm.
