arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2310.01149cs.DS
收藏

关于 b-匹配与全动态最大 k-边着色

On $b$-Matching and Fully-Dynamic Maximum $k$-Edge Coloring

Antoine El-Hayek, Kathrin Hanauer, Monika Henzinger

AI总结:

本文研究动态图上的最大 k-边着色问题,利用 b-匹配与 k-边着色的近似关系,基于动态 b-匹配算法作为黑盒提出 MatchO、MatchA 和贪心算法,分别在不同对手模型下实现改进的近似比与更新时间。

摘要:

给定一个通过一系列边插入和删除操作修改的图 G,我们研究最大 k-边着色问题:在可以使用 k 种颜色的情况下,如何为 G 中尽可能多的边着色,使得任意两条相邻边不共享相同颜色?虽然该问题不同于简单地维护 b=k 的 b-匹配,但这两个问题密切相关:一个最大 k-匹配总是包含一个 (k+1)/k 近似的最大 k-边着色。然而,最大 b-匹配在静态环境下可以高效求解,而最大 k-边着色问题是 NP 难的,并且对于 k≥2 甚至是 APX 难的。我们针对这两个问题给出了新结果:对于 b-匹配,我们展示了一个新的完整性间隙结果,并且对于 b 为常数的情形,我们适配了 Wajc 的匹配稀疏化方案 [STOC20]。以此为基础,我们为动态最大 k-边着色问题给出了三个新算法:我们的 MatchO 算法建立在 Bhattacharya、Gupta 和 Mohan [ESA17] 针对 b-匹配的动态 (2+ε)-近似算法之上,在面对不经意对手时以 O(poly(log n, ε^{-1})) 的更新时间实现了 (2+ε)(k+1)/k 近似比。我们的 MatchA 算法建立在 Bhattacharya、Henzinger 和 Italiano [SODA15] 针对分数 b-匹配的动态 8-近似算法之上,在面对自适应对手时以 O(poly(log n, ε^{-1})) 的更新时间实现了 (8+ε)(3k+3)/(3k-1) 近似比。此外,我们的归约将动态 b-匹配算法作为黑盒使用,因此动态 b-匹配近似比的任何未来改进都将自动转化为我们算法更好的近似比。最后,我们提出了一个贪心算法,其运行时间为 O(Δ+k) 更新时间,同时保证 2.16 的近似因子。

英文摘要:

Given a graph $G$ that is modified by a sequence of edge insertions and deletions, we study the Maximum $k$-Edge Coloring problem Having access to $k$ colors, how can we color as many edges of $G$ as possible such that no two adjacent edges share the same color? While this problem is different from simply maintaining a $b$-matching with $b=k$, the two problems are closely related: a maximum $k$-matching always contains a $\frac{k+1}k$-approximate maximum $k$-edge coloring. However, maximum $b$-matching can be solved efficiently in the static setting, whereas the Maximum $k$-Edge Coloring problem is NP-hard and even APX-hard for $k \ge 2$. We present new results on both problems: For $b$-matching, we show a new integrality gap result and for the case where $b$ is a constant, we adapt Wajc's matching sparsification scheme~[STOC20]. Using these as basis, we give three new algorithms for the dynamic Maximum $k$-Edge Coloring problem: Our MatchO algorithm builds on the dynamic $(2+ε)$-approximation algorithm of Bhattacharya, Gupta, and Mohan~[ESA17] for $b$-matching and achieves a $(2+ε)\frac{k+1} k$-approximation in $O(poly(\log n, ε^{-1}))$ update time against an oblivious adversary. Our MatchA algorithm builds on the dynamic $8$-approximation algorithm by Bhattacharya, Henzinger, and Italiano~[SODA15] for fractional $b$-matching and achieves a $(8+ε)\frac{3k+3}{3k-1}$-approximation in $O(poly(\log n, ε^{-1}))$ update time against an adaptive adversary. Moreover, our reductions use the dynamic $b$-matching algorithm as a black box, so any future improvement in the approximation ratio for dynamic $b$-matching will automatically translate into a better approximation ratio for our algorithms. Finally, we present a greedy algorithm that runs in $O(Δ+k)$ update time, while guaranteeing a $2.16$~approximation factor.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑