Exploiting sparsity in the sum-of-squares approximations to robust semidefinite programs
ACC'09 Proceedings of the 2009 conference on American Control Conference
Algorithms and theory of computation handbook
Regular language constrained sequence alignment revisited
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Angle-restricted steiner arborescences for flow map layout
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
| Hi-index | 0.00 |
Given a set of points in the first quadrant, a rectilinear Steiner arborescence (RSA) is a directed tree rooted at the origin, containing all points, and composed solely of horizontal and vertical edges oriented from left to right, or from bottom to top. The complexity of finding an RSA with the minimum total edge length for general planar point sets has been a well-known open problem in algorithm design and VLSI routing. In this paper, we prove the problem is NP-complete in the strong sense.