A Mathematica notebook that, given a list of verticies, solves for a rectilinear Steiner Tree. It uses the assumption that at least one vertex in the list is the root of two subtrees of the optimal Steiner Tree. This was hastily written for a final project in a Mathematical Modeling class and is most likely plagued by bugs and inefficient implementations.
The notebook GraphProc.nb generates the list of optimal
trees on verticies {{0,15}, {5,20}, {16,24}, {20,20}, {33,25}, {23,11}, {35,7}, {25,0}, {10,3}} saved in
MMFP_reduced_graphs.