Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs.
Thomas BläsiusPhilipp FischbeckTobias FriedrichMaximilian KatzmannPublished in: Theory Comput. Syst. (2023)
Keyphrases
- vertex cover
- random graphs
- approximation algorithms
- undirected graph
- planar graphs
- polynomial time approximation
- special case
- graph theoretic
- np hard
- worst case
- partial order
- minimum cost
- precedence constraints
- phase transition
- constant factor
- combinatorial optimization
- finding optimal
- approximation ratio
- upper bound
- level set
- simulated annealing
- optimality criterion
- lower bound