On the max min vertex cover Problem.

Nicolas Boria Federico Della Croce Vangelis Th. Paschos

Published in: WAOA (2013)

Keyphrases

max min
vertex cover
approximation algorithms
min max
partial order
planar graphs
precedence constraints
optimality criterion
robust optimization
np hard
worst case
hill climbing
special case
state space
log likelihood