Login / Signup
A Substructure based Lower Bound for Eternal Vertex Cover Number.
Jasine Babu
Veena Prabhakaran
Arko Sharma
Published in:
ICTCS (2020)
Keyphrases
</>
lower bound
vertex cover
upper bound
scheduling problem
objective function
computational complexity
probabilistic model
simulated annealing
branch and bound algorithm