Tight Running Time Lower Bounds for Vertex Deletion Problems.

Christian Komusiewicz

Published in: ACM Trans. Comput. Theory (2018)

Keyphrases

lower bound
upper bound
randomly generated problems
objective function
problems involving
search algorithm
optimization problems
np complete
worst case
directed graph
branch and bound algorithm
integer programming
lower bounding