• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Parameterized complexity of the k-arc Chinese Postman Problem.

Gregory Z. GutinMark JonesBin Sheng
Published in: J. Comput. Syst. Sci. (2017)
Keyphrases
  • parameterized complexity
  • global constraints
  • fixed parameter tractable
  • symmetry breaking
  • computational problems
  • database
  • np hard
  • worst case