Login / Signup

The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth.

Gregory Z. GutinMark JonesMagnus Wahlström
Published in: SIAM J. Discret. Math. (2016)
Keyphrases
  • search engine
  • special case
  • scheduling problem
  • bounded treewidth
  • polynomially solvable