Polynomial Time Approximation Scheme for the Rectilinear Steiner Arborescence Problem |
| |
| Authors: | Bing Lu Lu Ruan |
| |
| Institution: | (1) Computer Science Department, University of Minnesota, Minneapolis, MN 55455, USA;(2) Computer Science Department, University of Minnesota, Minneapolis, MN 55455, USA |
| |
| Abstract: | Given a set N of n terminals in the first quadrant of the Euclidean plane E
2, 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 (Shi and Su, 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), January 2000, to appear). In this paper, we present a polynomial time approximation scheme for this problem. |
| |
| Keywords: | PTAS arborescence Steiner terminals VLSI design approximation algorithm |
| 本文献已被 SpringerLink 等数据库收录！ |
|
