Login / Signup

An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs.

Ruo-Wei HungMaw-Shang Chang
Published in: Theor. Comput. Sci. (2011)
Keyphrases
  • hamiltonian cycle
  • learning algorithm
  • cost function
  • dynamic programming
  • simulated annealing
  • traveling salesman problem
  • computational complexity
  • np hard
  • optimal solution
  • lower bound
  • linear programming
  • noisy data