A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses.
Julián MestrePublished in: APPROX-RANDOM (2005)
Keyphrases
- vertex cover
- approximation algorithms
- primal dual
- np hard
- worst case
- linear programming
- objective function
- polynomial time approximation
- convergence rate
- learning algorithm
- linear program
- planar graphs
- computational complexity
- probabilistic model
- special case
- search space
- em algorithm
- dynamic programming
- convex optimization
- undirected graph
- precedence constraints
- constant factor
- optimal solution
- integrality gap
- interior point algorithm
- algorithm for linear programming