Parameterized complexity of k-Chinese Postman Problem.

Gregory Z. Gutin Gabriele Muciaccia Anders Yeo

Published in: Theor. Comput. Sci. (2013)

Keyphrases

parameterized complexity
fixed parameter tractable
global constraints
databases
np hard
constraint satisfaction
computational problems
lower bound
bounded treewidth