A faster dynamic programming algorithm for exact rectilinear Steiner minimal trees

An exact rectilinear Steiner minimal tree algorithm is presented that improves upon the time and space complexity of previous guarantees and is easy to implement. Experimental evidence is presented that demonstrates that the algorithm also works well an practice.-T-I 1