Reoptimization of Path Vertex Cover Problem.

Mehul Kumar Amit Kumar C. Pandu Rangan

Published in: CoRR (2019)

Keyphrases

vertex cover
approximation algorithms
planar graphs
precedence constraints
partial order
shortest path
minimum cost
log likelihood
polynomial time approximation
np hard
simulated annealing
optimality criterion