Approximation Algorithms for the Minimum-Length Corridor and Related Problems

Given a rectangular boundary partitioned into rectangles, the MLC-R problem is to find a Minimum EdgeLength Corridor that visits at least one point from the boundary of every rectangle and from the rectangular boundary. We present the first polynomial time constant ratio approximation algorithm for the MLC-R problem, which has been shown to be NP-hard [5].

• Type: Conference
• Year: 2007
• Where: CCCG
• Authors: Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
• Keywords: CCCG 2007, Computational Geometry, MLC-R Problem, Rectangular Boundary, first Polynomial Time