Parameterized Complexity of the $k$-Arc Chinese Postman Problem.

Gregory Z. Gutin Mark Jones Bin Sheng

Published in: CoRR (2014)

Keyphrases

parameterized complexity
fixed parameter tractable
global constraints
symmetry breaking
np hard
knowledge representation
np complete
databases
knowledge base
relational databases
dynamic programming
worst case
combinatorial problems
relational learning