ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

Weight Constrained Travelling Salesman Problem on Halin Graphs

Journal: International Journal of Science and Research (IJSR) (Vol.3, No. 5)

Publication Date:

Authors : ;

Page : 1473-1480

Keywords : Travelling Salesman Problem; Halin graph; NP-Complete; Approximation scheme; pseudo-polynomial time algorithm;

Source : Downloadexternal Find it from : Google Scholarexternal


We prove that the Weight Constrained Travelling Salesman Problem is NP- Complete by polynomially transforming the 0-1 Knapsack Problem to it and vice-versa. We present a pseudo-polynomial time algorithm for computing a weight constrained minimum cost Hamilton cycle in a Halin graph and then present a fully polynomial time approximation scheme for this NP-hard problem.

Last modified: 2014-07-03 16:36:09