Login / Signup

Parameterized Complexity of (A, ℓ )-Path Packing.

Rémy BelmonteTesshu HanakaMasaaki KanzakiMasashi KiyomiYasuaki KobayashiYusuke KobayashiMichael LampisHirotaka OnoYota Otachi
Published in: Algorithmica (2022)
Keyphrases
  • parameterized complexity
  • fixed parameter tractable
  • global constraints
  • shortest path
  • databases
  • special case
  • symmetry breaking
  • computational complexity
  • np hard
  • dynamic programming
  • np complete
  • integer programming