Login / Signup

Improved approximations for TSP with simple precedence constraints.

Hans-Joachim BöckenhauerTobias MömkeMonika Steinová
Published in: J. Discrete Algorithms (2013)
Keyphrases
  • precedence constraints
  • scheduling problem
  • vertex cover
  • traveling salesman problem
  • approximation algorithms
  • single machine scheduling problem
  • planar graphs
  • unit length
  • supply chain
  • parallel processors