Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover.

Peter Damaschke

Published in: IWPEC (2009)

Keyphrases

vertex cover
approximation algorithms
optimization problems
decision problems
partial order
planar graphs
genetic algorithm
reinforcement learning
np hard
np complete