Login / Signup

Parameterized Complexity and Approximability of the SLCS Problem.

Sylvain Guillemot
Published in: IWPEC (2008)
Keyphrases
  • parameterized complexity
  • approximation algorithms
  • global constraints
  • fixed parameter tractable
  • np hard
  • database
  • symmetry breaking
  • databases
  • computational problems