Fast Optimal Algorithms for the Minimum Rectilinear Steiner Arborescence Problem