The Rectilinear Steiner Arborescence (RSA) problem is “Given a setN ofn nodes lying in the first quadrant of E2, find the shortest directed tree rooted at the origin, containing all nodes inN, and composed solely of horizontal and vertical arcs oriented only from left to right or from bottom to top.” In this paper we investigate many fundamental properties of the RSA problem, propose anO(n logn)-time heuristic algorithm giving an RSA whose length has an upper bound of twice that of the minimum length RSA, and show that a polynomial-time algorithm that was earlier reported in the literature for this problem is incorrect.
Key wordsSteiner trees Rectilinear distance Directed graphs Steiner ratio Heuristics
Unable to display preview. Download preview PDF.
- R. R. Ladeira de Matos, A Rectilinear Arborescence Problem, Dissertation, University of Alabama, 1979.Google Scholar
- J. S. Provan, A Polynomial Algorithm for the Steiner Tree Problem on Terminal-Planar Graphs, Technical Report UNC/ORST/TR-83/10, University of North Carolina, 1983.Google Scholar