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

具有潜在双曲几何的无标度网络上顶点覆盖的高效近似

Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry

Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann

AI总结:

针对顶点覆盖问题理论与实践的近似性能差距,提出适配双曲随机图的改进贪心算法,可渐近几乎必然得到(1+o(1))近似,时间复杂度O(m log(n)),还能通过参数调节权衡,在真实网络上优于原贪心算法。

摘要:

在网络中寻找最小顶点覆盖是一个基础的NP完全图问题。应对其计算难度的一种方法是,牺牲算法的定性性能(允许非最优输出)以换取更快的运行速度。对于顶点覆盖问题,在理解这种权衡方面存在理论与实践之间的差距。一方面,已知将最小顶点覆盖的近似比控制在√2以内是NP难的。另一方面,一种简单的贪心算法在实践中能得到接近最优的近似结果。\n理解这一差异的一个有前景的思路是,认识到理论最坏情况实例与现实世界网络之间的差异。沿着这一方向,我们通过提出一种算法来弥合理论与实践之间的差距,该算法能在双曲随机图(一种在度分布、聚类性和小世界特性方面与现实世界网络高度相似的网络模型)上高效计算近乎最优的顶点覆盖近似。更具体地说,我们的算法能以渐近几乎必然的方式计算(1 + o(1))近似,且运行时间为O(m log(n))。\n所提出的算法是对成熟贪心方法的改进,新增了一个过程来优化贪心算法无法得到最优解的图局部区域。这使得我们可以引入一个参数,用于调节近似性能与运行时间之间的权衡。我们在现实世界网络上的实证评估表明,该方法能够在贪心算法的近最优结果基础上进一步提升性能。

英文摘要:

Finding a minimum vertex cover in a network is a fundamental NP-complete graph problem. One way to deal with its computational hardness, is to trade the qualitative performance of an algorithm (allowing non-optimal outputs) for an improved running time. For the vertex cover problem, there is a gap between theory and practice when it comes to understanding this tradeoff. On the one hand, it is known that it is NP-hard to approximate a minimum vertex cover within a factor of $\sqrt{2}$. On the other hand, a simple greedy algorithm yields close to optimal approximations in practice. A promising approach towards understanding this discrepancy is to recognize the differences between theoretical worst-case instances and real-world networks. Following this direction, we close the gap between theory and practice by providing an algorithm that efficiently computes nearly optimal vertex cover approximations on hyperbolic random graphs; a network model that closely resembles real-world networks in terms of degree distribution, clustering, and the small-world property. More precisely, our algorithm computes a $(1 + o(1))$-approximation, asymptotically almost surely, and has a running time of $\mathcal{O}(m \log(n))$. The proposed algorithm is an adaptation of the successful greedy approach, enhanced with a procedure that improves on parts of the graph where greedy is not optimal. This makes it possible to introduce a parameter that can be used to tune the tradeoff between approximation performance and running time. Our empirical evaluation on real-world networks shows that this allows for improving over the near-optimal results of the greedy approach.

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

↑