A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs
Symposium on Theoretical Aspects of Computer Science
The VertexCover problem is proven to be computationally hard in different ways: It is NP-complete to find an optimal solution and even NP-hard to find an approximation with reasonable factors. In contrast, recent experiments suggest that on many real-world networks the run time to solve VertexCover is way smaller than even the best known FPT-approaches can explain. Similarly, greedy algorithms deliver very good approximations to the optimal solution in practice. We link these observations todoi:10.4230/lipics.stacs.2020.25 dblp:conf/stacs/BlasiusF0K20 fatcat:fzxm3wsptfcqbnwzfyl2pnxzc4