Given a complete graph with edge-weights satisfying parameterized triangle inequality, we consider the maximum Hamilton path problem and design some approximation algorithms. [1] Z.-Z. Chen and T.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback