Highly scalable algorithms for rectilinear and octilinear Steiner trees

Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

Volumn 2003-January, Issue , 2003, Pages 827-833

  Kahng, A B ^a   Mandoiu I I ^a   Zelikovsky, A Z ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b GEORGIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATION; COMPUTER AIDED DESIGN; DECISION TREES; DESIGN; GRAPHIC METHODS;

CONTRACTION ALGORITHMS; MINIMUM SPANNING TREES; NEAR-OPTIMAL; RANDOM INSTANCE; RECTILINEAR STEINER MINIMUM TREES; RECTILINEAR STEINER TREES; SCALABLE ALGORITHMS; STEINER TREES;

TREES (MATHEMATICS);

EID: 84954455646     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASPDAC.2003.1195132     Document Type: Conference Paper

References (22)

1. C. Alpert. Personal communication.
2. P. Berman, U. Fossmeier, M. Kaufmann, M. Karpinski and A. Zelikovsky. Approaching the 5/4-approximation for rectilinear Steiner trees, in K. W. Ng et al. (eds.), Proc. European Symp. on Algorithms (ESA), Springer Verlag Lecture Notes in Computer Science 762, 1994, pp. 533-542.
3. M. Borah, R.M. Owens, and M.J. Irwin. A fast and simple Steiner routing heuristic, Discrete Applied Mathematics 90 (1999), pp. 51-67
4. G. Cattaneo, P. Faruolo, U.F. Petrillo, and G.F. Italiano. Maintaining dynamic minimum spanning trees: an experimental study, in D.M. Mount, C. Stein (eds.), Proc. 4th Int. Workshop on Algorithm Engineering and Experiments (ALENEX), Springer Verlag Lecture Notes in Computer Science 2409, 2002, pp. 111-125.
5. U. Fößmeier, M. Kaufmann and A. Zelikovsky. Faster approximation algorithms for the rectilinear Steiner tree problem, Discrete & Computational Geometry 18 (1997), pp. 93-109.
6. E.N. Gilbert, H.O. Pollak. Steiner minimal trees, SIAM J. Appl. Math. 32 (1977) pp. 826-834.
7. L.J. Guibas and J. Stolfi. On computing all north-east nearest neighbors in the L1 metric Information Processing Letters 17 (1983), pp. 219-223.
8. M. Hanan. On Steiner's problem with rectilinear distance, SIAM Journal on Applied Mathematics 14 (1966), 255-265.
9. F.K. Hwang and D.S. Richards and P. Winter. The Steiner tree problem. North-Holland, Annals of Discrete Mathematics 53, 1992.
10. A.B. Kahng and G. Robins. A new class of iterative Steiner tree heuristics with good performance, IEEE Trans. on CAD 11 (1992), pp. 1462-1465.
11. C.-K. Koh and P.H. Madden, Manhattan or Non-Manhattan? A study of alternative VLSI routing architectures, in Proc. Great Lakes Symposium on VLSI, 2000, pp. 47-52.
12. I.I. Mǎndoiu, V.V. Vazirani, and J.L. Ganley. A new heuristic for rectilinear Steiner trees. IEEE Transactions on Computer-Aided Design 19 (2000) pp. 1129-1139.
13. B.K. Nielsen, P. Winter, and M. Zachariasen. An exact algorithm for the uniformly-oriented Steiner tree problem, in R. Möhring and R. Raman (eds.), Proc. European Symp. on Algorithms (ESA), Springer Verlag Lecture Notes in Computer Science 2461, 2002, pp. 760-772.
14. A. Rohe. Sequential and parallel algorithms for local routing, Ph.D. Thesis, Bonn University, Bonn, Germany, December 2001.
15. L. Scheffer. Rectilinear MST code, available as part of the RMST-Pack at http://www.gigascale.org/bookshelf/slots/RSMT/RMST/.
16. S. Teig, The X architecture: Not your father's diagonal wiring, inn Proc. ACM/IEEE Workshop on System Level Interconnect Prediction (SLIP), 2002, pp. 33-37.
17. D.M. Warme, P. Winter, and M. Zacharisen. GeoSteiner 3.1 package, available from http://www.diku.dk/geosteiner/
18. http://www.xinitiative.org
19. M.C. Yildiz and P.H. Madden. Preferred direction Steiner trees, in Proc. Great Lakes Symposium on VLSI, 2001, pp. 56-61.
20. M. Zachariasen. Personal communication, August 2002.
21. A. Zelikovsky. An 11/6-approximation for the network Steiner tree problem, Algorithmica 9 (1993), pp. 463-470.
22. H. Zhou, N. Shenoy, and W. Nicholls. Efficient minimum spanning tree construction without Delaunay triangulation, in Proc. Asia-Pacific Design Automation Conference (ASP-DAC), 2001, pp. 192-197.