Parameterized complexity of the k-arc Chinese Postman Problem.

Gregory Z. Gutin Mark Jones Bin 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