A faster algorithm for Vertex Cover parameterized by solution size.

David G. Harris N. S. Narayanaswamy

Published in: CoRR (2022)

Keyphrases

vertex cover
computational complexity
optimal solution
learning algorithm
worst case
np hard
dynamic programming
closed form
brute force search
objective function
special case
upper bound
theoretical analysis
knapsack problem
bin packing