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

A Fully Polynomial Time Approximation Scheme for Weight Constrained BTSP with Two Linear Constraints on Halin Graphs

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

Publication Date:

Authors : ;

Page : 315-317

Keywords : Bottleneck Travelling Salesman Problem; Halin graph; NP-Complete; Threshold algorithm; polynomial time approximation scheme.;

Source : Downloadexternal Find it from : Google Scholarexternal


Abstract: In this paper we show that the weight constrained version of BTSP i.e. WCBTSP on a Halin graph with n nodes can be solved in O(nlogn) time. We also show that WCBTSP with two linear constraints on a Halin graph can be solved in O(n (W1+1)2 logn) time, where W1 denotes the first right hand side constant.

Last modified: 2014-06-23 15:19:21