ganley.org -> The Steiner Tree Page

The Steiner Tree Page

Maintained by Joe Ganley


NOTE: Quite a few people have mailed me asking to be added to the People list, contributing refereces, asking for code, etc. I am behind (in some cases, really behind) on getting the pages updated with this new information, but hopefully it will be coming soon. If you are one of those people, sorry about that, but you know how it is: the paying work comes first :-).

Welcome to the Steiner Tree Page. I'll be adding to this later; for example, I plan to add a table giving the complexity of the problem for restricted classes of inputs, and to expand the introduction a bit to describe other variants on the problem. Another thing I plan to add eventually is code for various Steiner tree problems, starting with my own implementation of Dreyfus-Wagner and my exact rectilinear Steiner tree algorithms.

Please email me if you have ideas for other information that would be useful here.

News flash! Dave Warme, Pawel Winter, and Martin Zachariasen have made publicly available their world champion algorithm for computing optimal Steiner trees. This package, entitled GeoSteiner 3.0, computes optimal Euclidean and rectilinear Steiner trees (as well as minimum spanning trees in hypergraphs). March 2001: GeoSteiner 3.1 is released. It can be found at
http://www.diku.dk/geosteiner/


I need your help! If you do (or have done) research on Steiner trees, you can help make this page comprehensive by: