Abstracts
Abstract
We consider the problem of finding a cheapest Hamiltonian path of a complete graph satisfying a relaxed triangle inequality, i.e., such that for some parameter > 1, the edge costs satisfy the inequality c({x, y}) ≤ `c({x, z}) + c({z, y})´ for every triple of vertices x, y, z. There are three variants of this problem, depending on the number of prespecified endpoints: zero, one, or two. For metric graphs there exist approximation algorithms, with approximation ratio 32 for the first two variants and 53 for the latter one.
Using results on the approximability of the Travelling Salesman Problem with input graphs satisfying the relaxed triangle inequality, we obtain for our problem approximation algorithms with ratio min( 2 + , 32 2) for zero or one prespecified endpoints, and 53 2 for two endpoints.
Download the article in PDF to read it.
Download