A New Solver for the Minimum Weighted Vertex Cover Problem.

Hong Xu T. K. Satish Kumar Sven Koenig

Published in: CPAIOR (2016)

Keyphrases

vertex cover
approximation algorithms
minimum cost
partial order
planar graphs
constant factor
np hard
precedence constraints
optimality criterion
special case
spanning tree
polynomial time approximation
dynamic programming
reinforcement learning
objective function