On Exact Solutions for the Rectilinear Steiner Tree Problem

@inproceedings{Fmeier1997OnES,
  title={On Exact Solutions for the Rectilinear Steiner Tree Problem},
  author={Ulrich F{\"o}\ssmeier and Michael Kaufmann},
  booktitle={Symposium on Computational Geometry},
  year={1997}
}
The rectilinear Steiner tree problem asks for a shortest tree connecting given points in the plane with rectilinear distance. To find exact solutions for such problems is very challenging and could be done only for problems of very small size. The best theoretically analysed algorithms for this problem have a running time of O(n2. 2.62 ") (Gan-ley/Cohoon) resp. n o (W Smith), The best implementa-(tions use Branch & Bound and can solve random problems of size 35 (Salowe/ Warme) witbin a day… CONTINUE READING
10 Citations
2 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-2 of 2 references

How to nd Steiner minimal trees in Euclidian d-space

  • W. D. Smith
  • Algorithmica 7
  • 1992
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…