An O∗(2.619k) algorithm for 4-Path Vertex Cover.

Published in: Discret. Appl. Math. (2021)

Keyphrases

vertex cover
theoretical analysis
learning algorithm
dynamic programming
objective function
computational complexity
np hard
knapsack problem
search space
special case
worst case
energy function