Eternal Connected Vertex Cover Problem.

Toshihiro Fujito Tomoya Nakamura

Published in: TAMC (2020)

Keyphrases

vertex cover
approximation algorithms
partial order
planar graphs
precedence constraints
optimality criterion
worst case
connected components
partially ordered
log likelihood
np hard
theoretical analysis
shortest path
greedy algorithm
special case
upper bound
polynomial time approximation