Sciweavers

SODA
2000
ACM
114views Algorithms» more  SODA 2000»
14 years 8 days ago
The rectilinear Steiner arborescence problem is NP-complete
Given a set P of points in the first quadrant, a Rectilinear Steiner Arborescence (RSA) is a directed tree rooted at the origin, containing all points in P, and composed solely of...
Weiping Shi, Chen Su