TY - JFULL AU - Priyadarsini P.L.K and Hemalatha T. PY - 2007/12/ TI - An Alternative Proof for the NP-completeness of Top Right Access point-Minimum Length Corridor Problem T2 - International Journal of Mathematical and Computational Sciences SP - 533 EP - 537 VL - 1 SN - 1307-6892 UR - https://publications.waset.org/pdf/6907 PU - World Academy of Science, Engineering and Technology NX - Open Science Index 11, 2007 N2 - In the Top Right Access point Minimum Length Corridor (TRA-MLC) problem [1], a rectangular boundary partitioned into rectilinear polygons is given and the problem is to find a corridor of least total length and it must include the top right corner of the outer rectangular boundary. A corridor is a tree containing a set of line segments lying along the outer rectangular boundary and/or on the boundary of the rectilinear polygons. The corridor must contain at least one point from the boundaries of the outer rectangle and also the rectilinear polygons. Gutierrez and Gonzalez [1] proved that the MLC problem, along with some of its restricted versions and variants, are NP-complete. In this paper, we give a shorter proof of NP-Completeness of TRA-MLC by findig the reduction in the following way. ER -