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.
Beyond Trees: The Weighted Center Problem on Gromov Hyperbolic Graphs
University of Bucharest, Faculty of Mathematics and Computer Science(布加勒斯特大学数学与计算机科学系);National Institute for Research and Development in Informatics(信息学研究与开发国家研究所)
Space Lower Bounds for Approximating Maximum Matching in the Edge Arrival Model
在线和流媒体环境中的二分匹配问题最近受到了很多关注。经典的顶点到达设置,著名的Karp,Vazirani和Vazirani(KVV)算法实现了$1-1/e$近似,这是相当好理解的:$1-1/e$近似在在线和半流设置中都是最优的,其中算法被约束为使用$n\cdot \log^{O(1)} n$空间。更具有挑战性的边缘到达模型最近在在线算法文献中取得了重大进展。对于严格在线模型(无抢占),已排除优于平凡因子$1/2$的近似值[Gamlath et al'FOCS'19]。对于限制较少的在线抢先模型,已经排除了优于$\frac1{1+\ln 2}$ -近似[Epstein et al'STACS'12]甚至优于$(2-\sqrt{2})$ -近似[Huang et al'SODA'19]的情况。边缘到达模型中的在线抢先匹配的最新硬度结果是基于使用边缘到达将KVV硬实例的多个副本串在一起的想法。在本文中,我们将展示如何实现这样的建设使用的想法在Ruzsa-Szemerédi图的文献中。其结果是,我们表明,任何单程流算法,近似的最大匹配的二分图与$n$顶点的一个因素比$\frac1{1+\ln 2}\approx 0.59$需要$n^{1+Ω(1/\log\log n)}\gg n \log^{O(1)} n$空间。这给出了经典的单侧顶点到达设置和半流模型中的边到达设置之间的第一分离。