Polynomial Time Approximation Scheme for the Rectilinear Steiner Arborescence Problem
Published Date
Publisher
Type
Abstract
Given a set N of n terminals in the first quadrant of the Euclidean plane E2, find a minimum length directed tree rooted at the origin o, connecting to all terminals in N, and consisting of only horizontal and vertical arcs oriented from left to right or from bottom to top. This problem is called rectilinear Steiner arborescence problem, which has been proved to be NP-complete recently. In this paper, we present a polynomial time approximation scheme for this problem.
Keywords
Description
Related to
item.page.replaces
License
Series/Report Number
Technical Report; 00-012
Funding Information
item.page.isbn
DOI identifier
Previously Published Citation
Other identifiers
Suggested Citation
Lu, Bing; Ruan, Lu. (2000). Polynomial Time Approximation Scheme for the Rectilinear Steiner Arborescence Problem. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215401.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.