Downloads: 104
Research Paper | Mathematics | India | Volume 3 Issue 5, May 2014
Weight Constrained Travelling Salesman Problem on Halin Graphs
Dharmananda Gahir
Abstract: 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.
Keywords: Travelling Salesman Problem, Halin graph, NP-Complete, Approximation scheme, pseudo-polynomial time algorithm
Edition: Volume 3 Issue 5, May 2014,
Pages: 1473 - 1480
How to Cite this Article?
Dharmananda Gahir, "Weight Constrained Travelling Salesman Problem on Halin Graphs", International Journal of Science and Research (IJSR), Volume 3 Issue 5, May 2014, pp. 1473-1480, https://www.ijsr.net/get_abstract.php?paper_id=20132158
How to Share this Article?
Similar Articles with Keyword 'Travelling Salesman Problem'
Downloads: 126
Research Paper, Mathematics, India, Volume 3 Issue 12, December 2014
Pages: 184 - 186Travelling Salesman Problem (TSP) Using Fuzzy Quantifier
Downloads: 130
Research Paper, Mathematics, India, Volume 3 Issue 6, June 2014
Pages: 315 - 317A Fully Polynomial Time Approximation Scheme for Weight Constrained BTSP with Two Linear Constraints on Halin Graphs
Dharamananada Gahir