Login / Signup
On Approximability of Connected Path Vertex Cover.
Toshihiro Fujito
Published in:
WAOA (2017)
Keyphrases
</>
vertex cover
approximation algorithms
minimum cost
polynomial time approximation
np hard
special case
worst case
partial order
shortest path
precedence constraints
approximation ratio
planar graphs
connected components
conditional random fields
optimality criterion
probabilistic model
search algorithm