Login / Signup
An O^*(2.619^k) algorithm for 4-path vertex cover.
Dekel Tsur
Published in:
CoRR (2018)
Keyphrases
</>
vertex cover
learning algorithm
worst case
theoretical analysis
objective function
optimal solution
np hard
dynamic programming
computational complexity
search space
special case
probabilistic model
upper bound
simulated annealing
graph cuts
shortest path
closed form
directed graph
spanning tree
model free