Years and Authors of Summarized Original Work
2003; Zhou
Problem Definition
Given n points on a plane, a Steiner minimal tree connects these points through some extra points (called Steiner points) to achieve a minimal total length. When the length between two points is measured by the rectilinear distance, the tree is called a rectilinear Steiner minimal tree.
Because of its importance, there is much previous work to solve the SMT problem. These algorithms can be grouped into two classes: exact algorithms and heuristic algorithms. Since SMT is NP-hard, any exact algorithm is expected to have an exponential worst-case running time. However, two prominent achievements must be noted in this direction. One is the GeoSteiner algorithm and implementation by Warme, Winter, and Zacharisen [14, 15], which is the current fastest exact solution to the problem. The other is a Polynomial Time Approximation Scheme (PTAS) by Arora [1], which is mainly of theoretical importance. Since exact...
Recommended Reading
Arora S (1998) Polynomial-time approximation schemes for Euclidean TSP and other geometric problem. J ACM 45:753–782
Borah M, Owens RM, Irwin MJ (1994) An edge-based heuristic for steiner routing. IEEE Trans Comput Aided Des 13:1563–1568
Chu C (2004) FLUTE: Fast lookup table based wirelength estimation technique. In: Proceedings of the international conference on computer-aided design, San Jose, pp 696–701
Chu C, Wong YC (2005) Fast and accurate rectilinear steiner minimal tree algorithm for VLSI design. In: Proceedings of the international symposium on physical design, San Francisco, pp 28–35
Cormen TH, Leiserson CE, Rivest RL (1989) Introduction to algorithms. MIT, Cambridge
Griffith J, Robins G, Salowe JS, Zhang T (1994) Closing the gap: near-optimal steiner trees in polynomial time. IEEE Trans Comput Aided Des 13:1351–1365
Ho JM, Vijayan G, Wong CK (1990) New algorithms for the rectilinear steiner tree problem. IEEE Trans Comput Aided Des 9:185–193
Hwang FK (1976) On steiner minimal trees with rectilinear distance. SIAM J Appl Math 30:104–114
Kahng AB, Mandoiu II, Zelikovsky A (2003) Highly scalable algorithms for rectilinear and octilinear steiner trees. In: Proceedings of the Asia and South Pacific design automation conference, Kitakyushu, pp 827–833
Kahng AB, Robins G (1992) A new class of iterative steiner tree heuristics with good performance. IEEE Trans Comput Aided Des 11:893–902
Mandoiu II, Vazirani VV, Ganley JL (1999) A new heuristic for rectilinear steiner trees. In: Proceedings of the international conference on computer-aided design, San Jose
Rajagopalan S, Vazirani VV (1999) On the bidirected cut relaxation for the metric steiner tree problem. In: Proceedings of the 10th ACM-SIAM symposium on discrete algorithms, Baltimore, pp 742–751
Rohe A (2001) Sequential and parallel algorithms for local routing. Ph.D. thesis, Bonn University, Bonn
Warme DM, Winter P, Zacharisen M (2003) GeoSteiner 3.1 package. ftp://ftp.diku.dk/diku/users/martinz/geosteiner-3.1.tar.gz. Accessed Oct 2003
Warme DM, Winter P, Zacharisen M (1998) Exact algorithms for plane steiner tree problems: a computational study. Tech. Rep. DIKU-TR-98/11, Dept. of Computer Science, University of Copenhagen
Zhou H (2003) Efficient Steiner tree construction based on spanning graphs. In: ACM international symposium on physical design, Monterey
Zhou H, Shenoy N, Nicholls W (2002) Efficient spanning tree construction without delaunay triangulation. Inf Process Lett 81:271–276
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer Science+Business Media New York
About this entry
Cite this entry
Zhou, H. (2015). Rectilinear Steiner Tree. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27848-8_337-2
Download citation
DOI: https://doi.org/10.1007/978-3-642-27848-8_337-2
Received:
Accepted:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Online ISBN: 978-3-642-27848-8
eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering