Parameterized Complexity of Vertex Cover Variants.
Jiong GuoRolf NiedermeierSebastian WernickePublished in: Theory Comput. Syst. (2007)
Keyphrases
- vertex cover
- parameterized complexity
- approximation algorithms
- fixed parameter tractable
- global constraints
- precedence constraints
- np hard
- partial order
- planar graphs
- optimality criterion
- polynomial time approximation
- special case
- undirected graph
- symmetry breaking
- log likelihood
- computational complexity
- scheduling problem
- evolutionary algorithm