Extension and Its Price for the Connected Vertex Cover Problem.

Mehdi Khosravian Ghadikolaei Nikolaos Melissinos Jérôme Monnot Aris Pagourtzis

Published in: IWOCA (2019)

Keyphrases

vertex cover
approximation algorithms
planar graphs
precedence constraints
optimality criterion
partial order
scheduling problem
special case
probabilistic model
worst case
theoretical analysis
connected components