Talk:Hamiltonian completion

APX?
Read in article:
 * Moreover, Hamiltonian completion belongs to the APX complexity class, i.e., it is unlikely that efficient constant ratio approximation algorithms exist for this problem.

Read APX article:
 * Class APX is the set of NP optimization problems that allow polynomial-time approximation algorithms with approximation ratio bounded by a constant (or constant-factor approximation algorithms for short).

Jumpow (talk) 11:22, 18 September 2017 (UTC)