Login / Signup
Reoptimization of Path Vertex Cover Problem.
Mehul Kumar
Amit Kumar
C. Pandu Rangan
Published in:
COCOON (2019)
Keyphrases
</>
vertex cover
approximation algorithms
partial order
planar graphs
minimum cost
precedence constraints
polynomial time approximation
shortest path
log likelihood
np hard
em algorithm
latent variables
finding optimal
optimality criterion