On the Parameterized Complexity of Relaxations of Clique.

Ambroise Baril Antoine Castillon Nacim Oijid

Published in: CoRR (2023)

Keyphrases

parameterized complexity
fixed parameter tractable
np hard
lower bound
global constraints
linear programming
computational problems
symmetry breaking
np complete
databases
optimal solution
search algorithm
constraint satisfaction problems
bounded treewidth