1. The Rectilinear Steiner Tree Problem is $NP$-Complete
2. D. M. Warme , P. Winter , and M. Zachariasen , " Exact algorithms for plane steiner tree problems: A computational study," in Advances in Steiner trees . Springer , 2000 , pp. 81 -- 116 . D. M. Warme, P. Winter, and M. Zachariasen, "Exact algorithms for plane steiner tree problems: A computational study," in Advances in Steiner trees. Springer, 2000, pp. 81--116.
3. GeoSteiner Inc. "Geosteiner: Software for computing steiner trees " http://www.geosteiner.com/ 2017. GeoSteiner Inc. "Geosteiner: Software for computing steiner trees " http://www.geosteiner.com/ 2017.
4. An
O
(
n
log
n
) Algorithm for Rectilinear Minimal Spanning Trees
5. On Steiner Minimal Trees with Rectilinear Distance