A Faster Dynamic Programming Algorithm For Exact Rectilinear Steiner TreesReport
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-
Note: Abstract extracted from PDF text
All rights reserved (no additional license for public reuse)
Lavinus, JW, and JP Cohoon. "A Faster Dynamic Programming Algorithm For Exact Rectilinear Steiner Trees." University of Virginia Dept. of Computer Science Tech Report (1993).
University of Virginia, Department of Computer Science