Complexity of the minimum-length corridor problem

被引：7
|
作者：
Gonzalez-Gutierrez, Arturo [1 ]
Gonzalez, Teofilo F. [1 ]
机构：
[1] Univ Calif Santa Barbara, Dept Comp Sci, Santa Barbara, CA 93106 USA
来源：
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | 2007年 / 37卷 / 02期
关键词：
NP-completeness; minimum-length corridor; minimum wire length; minimum optical fiber length;
D O I：
10.1016/j.comgeo.2006.10.002
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We study the Minimum-Length Corridor (MLC) problem. Given a rectangular boundary partitioned into rectilinear polygons, the objective is to find a corridor of least total length. A corridor is a set of line segments each of which must lie along the line segments that form the rectangular boundary and/or the boundary of the rectilinear polygons. The corridor is a tree, and must include at least one point from the rectangular boundary and at least one point from the boundary of each of the rectilinear polygons. We establish the NP-completeness of the decision version of the MLC problem even when it is restricted to a rectangular boundary partitioned into rectangles. (c) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码：72 / 103
页数：32
相关论文
共 50 条
12345