Efficient algorithms for the max k-vertex cover problem.

Federico Della Croce Vangelis Th. Paschos

Published in: J. Comb. Optim. (2014)

Keyphrases

vertex cover
approximation algorithms
planar graphs
partial order
precedence constraints
optimality criterion
log likelihood
worst case