Efficient octilinear steiner tree construction based on spanning graphs

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

Volumn , Issue , 2004, Pages 687-690

  Zhu, Qi ^a,c   Zhou, Hai ^b   Jing, Tong ^a   Hong, Xianlong ^a   Yang, Yang ^a  

^a TSINGHUA UNIVERSITY   (China)

^b NORTHWESTERN UNIVERSITY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GEOMETRY; GRAPH THEORY; HEURISTIC METHODS; RANDOM PROCESSES; SET THEORY; TREES (MATHEMATICS);

BATCHED GREEDY ALGORITHMS; CONTOURS; SPANNING GRAPHS; STEINER MINIMAL TREES;

OPTICAL INTERCONNECTS;

EID: 2442554956     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. M. Sarrafzadeh and C. K. Wong, "Hierarchical Steiner tree construction in uniform orientations", IEEE Trans on CAD, 1992, 11(9): pp.1095.
2. C. K. Koh, "Steiner Problem in octilinear routing model", Master's thesis, National University of Singapore, 1995
3. D. T. Lee, C. F. Shen, and C. L. Ding, "On Steiner tree problem with 45' routing", In: Proc. of IEEE ISCAS, Seattle, WA, USA, 1995: pp.1680.
4. G. Robins, "On Optimal Interconnections", Ph.D. thesis, University of California, Los Angels, 1992
5. C. K. Koh and P. H. Madden, "Manhattan or non-Manhattan? a study of alternative VLSI routing architectures", In: Proc. of GLSVLSI, San Diego, CA, USA, 2000: pp.47.
6. S. L. Teig, "The X architecture: not your father's diagonal writing", In: International Workshop on System Level Interconnect Prediction (SLIP), San Diego, CA, USA, 2002: pp.33.
7. C, Chiang and C. S. Chiang, "Octilinear Steiner tree construction", In: Proc. of IEEE MWSCAS, Tulsa, USA, 2002: pp.TAM11-216.
8. http://www.xinitiative.org/
9. A. B. Kahng, I. I. Mandoiu, and A. Z. Zelikovsky, "Highly Scalable Algorithms for Rectilinear and Octilinear Steiner Trees", In: Proc. Of ASP-DAC, 2003: pp.-
10. A. Zelikovsky, "An 11/6-approximation algorithm for the network Steiner problem", Algorithmica, 1993, 9: pp.463
11. A. B. Kahng and G. Robins, "A new class of Steiner tree heuristics with good performance", IEEE Trans on CAD, 1992, 11(7): pp.893
12. Chris S. Coulston, "Constructing Exact Octagonal Steiner Minimal Tree", In: Proc. of GLSVLSI, Washington DC, USA. 2003: pp.-.
13. M. Borah, R. M Owens, and M. J. Irwin, "An edge-based heuristic for Steiner routing", IEEE Transactions on CAD, 1994, 13: pp.1563.
14. H. Zhou, N. Shenoy, and W. Nicholls, "Efficient spanning tree construction without Delaney triangulation", Information Processing Letter, 2002, 81(5): pp.-
15. F. K. Hwang, "An O(n log n) algorithm for rectilinear minimal spanning trees", Journal of the ACM, 1979, 26(2): pp. 177.
16. U. Foßmeier, M. Kaufmann, and A. Zelikovsky, "Faster approximation algorithms for the rectilinear Steiner tree problem", Discrete & Computational Geometry, 1997, 18(1): pp.93.
17. T. H. Cormen, C. E. Leiserson, and R. H. Rivest, "Introduction to Algorithm", MIT Press, 1989
18. H. Zhou, "Efficient Steiner Tree Construction Based on Spanning Graphs", In: Proc. of ACMISPD, Monterey, CA, USA, 2003: pp.-.