A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs.
Daniel LokshtanovFahad PanolanSaket SaurabhJie XueMeirav ZehaviPublished in: SoCG (2024)
Keyphrases
- vertex cover
- approximation algorithms
- polynomial time approximation
- closed form
- simulated annealing
- optimal solution
- np hard
- expectation maximization
- theoretical analysis
- minimum spanning tree
- precedence constraints
- approximation ratio
- computational complexity
- probabilistic model
- energy function
- objective function
- branch and bound algorithm
- search space
- graph structure
- spanning tree
- optimality criterion