An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree
Given a graph, the Hamiltonian path completion problem is to find an augmenting edge set such that the augmented graph has a Hamiltonian path. In this paper, we show that the Hamiltonian path completion problem will unlikely have any constant ratio approximation algorithm unless NP = P. This problem remains hard to approximate even when the given subgraph is a tree. Moreover, if the edge weights are restricted to be either 1 or 2, the Hamiltonian path completion problem on a tree is still NP-hard. Then it is shown that this problem will unlikely have any fully polynomial-time approximation scheme (FPTAS) unless NP=P. When the given tree is a k-tree, we give an approximation algorithm with performance ratio 1.5.
Unable to display preview. Download preview PDF.
- 2.S. Arora. Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. In Proc. 37th Annual IEEE Symposium on Foundations of Computer Science, pages 2–11. IEEE Computer Society, 1996.Google Scholar
- 6.F. T. Boesch, S. Chen, and J. A. M. McHugh. On covering the points of a graph with point disjoint paths. In Lecture Notes in Mathematics, volume 46, pages 201–212. Springer, Berlin, 1974.Google Scholar
- 18.Z. Skupien. Path partitions of vertices and Hamiltonicity of graphs. In Proc. 2nd Czechoslovakian Symp. on Graph Theory, pages 481–491, Prague, 1974.Google Scholar
- 21.Q. S. Wu. On the Complexity and Approximability of Some Hamiltonian Path Problems. PhD Thesis, National Tsing Hua University, Taiwan, 2000.Google Scholar