Title of article
A Polynomial Time Algorithm for Rectilinear Steiner Trees with Terminals Constrained to Curves
Author/Authors
Thomas، M. D. A. نويسنده , , Brazil، M. نويسنده , , Weng، J. F. نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
-144
From page
145
To page
0
Abstract
The rectilinear Steiner problem is the problem of constructing the shortest rectilinear network in the plane connecting a given set of points, called terminals. The problem is known to be NP-complete in general. In this paper, we show that there is a polynomial time algorithm for solving the rectilinear Steiner problem for the case where terminals are constrained to lie on almost any fixed set of simple disjoint compact curves. © 1999 John Wiley & Sons, Inc. Networks 33: 145-155, 1999
Keywords
integer programming , dual ascent , distributed computing systems , telecommunications network
Journal title
NETWORKS
Serial Year
1999
Journal title
NETWORKS
Record number
13432
Link To Document