On the max min vertex cover problem.

Nicolas Boria Federico Della Croce Vangelis Th. Paschos

Published in: Discret. Appl. Math. (2015)

Keyphrases

max min
vertex cover
approximation algorithms
min max
partial order
planar graphs
precedence constraints
robust optimization
hill climbing
optimality criterion
polynomial time approximation
special case
minimum cost