A polynomial time $\frac 3 2$ -approximation algorithm for the vertex cover problem on a class of graphs
Qiaoming HanAbraham P. PunnenYinyu YePublished in: CoRR (2007)
Keyphrases
- vertex cover
- approximation algorithms
- polynomial time approximation
- planar graphs
- approximation ratio
- worst case
- theoretical analysis
- learning algorithm
- error bounds
- np hard
- dynamic programming
- expectation maximization
- computational complexity
- optimal solution
- search space
- approximation guarantees
- objective function
- em algorithm
- simulated annealing
- connected components
- special case
- bin packing
- lower bound