Login / Signup

Parameterized Complexity of the k-Arc Chinese Postman Problem.

Gregory Z. GutinMark JonesBin Sheng
Published in: ESA (2014)
Keyphrases
  • parameterized complexity
  • fixed parameter tractable
  • global constraints
  • symmetry breaking
  • objective function
  • dynamic programming
  • np complete
  • answer set programming