Cost-radius balanced spanning/steiner trees

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E80-A, Issue 4, 1997, Pages 689-693

  Mitsubayashi, Hideki ^a   Takahashi, Atsushi ^a   Kajitani, Yoji ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Delay; Spanning tree; Steiner tree; Vlsi layout

Indexed keywords

ALGORITHMS; DESIGN; HEURISTIC METHODS; OPTIMIZATION; SIGNAL DISTORTION; VLSI CIRCUITS;

SPANNING TREES;

TREES (MATHEMATICS);

EID: 0031117083     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (11)

1. C.J. Alpert, T.C. Hu, J.H. Huang, A.B. Kahng, and D. Karger, Prim-Dijkstra tradeoffs for improved performance driven routing tree design, IEEE Trans. Computer-Aided Design, vol.14, no.7, pp.890-896, July 1995.
2. K.D. Boese, J. Cong, A.B. Kahng, K.S. Leung, and D. Zhou, On highspeed VLSI interconnects: analysis and design, Proc. Asia-Pacific Conf. Circuits Syst., pp.35-40, Dec. 1992.
3. J. Cong, A.B. Kahng, G. Robins, M. Sarrafzadeh, and C.K. Wong, Provably good performance-driven global routing, IEEE Trans. CAD, vol.11, no.6, pp.739-752, June 1992.
4. J. Cong, K. Leung, and D. Zhou, Performance-driven interconnect design based on distributed RC delay model, Proc. ACM/IEEE Design Automat. Conf., pp.606-611, June 1993.
5. M. Garey and D.S. Johnson, The rectilinear Steiner problem is NP-complete, SIAM J. Appl. Math., vol.32, no.4, pp.826-834, April 1977.
6. M. Hanan, On Steiner's problem with rectilinear distance, SIAM J. APPL. MATH., pp.255-265, March 1966.
7. J. Ho, D.T. Lee, C.H. Chang, and C.K. Wong, Bounded diameter spanning trees and related problems, Proc. ACM Symp. Computational Geometry, pp.276-282, 1989.
8. J-M. Ho, G. Vijayan, and C.K. Wong, New algorithms for rectilinear Steiner trees, IEEE Trans. Computer-Aided Design, vol.9, no.2, pp.185-193, Feb. 1990.
9. S. Khuller, B. Raghavachari, and N. Young, Balancing minimum spanning and shortest path trees, Proc. ACM/SIAM Symp. Discrete Algorithms, pp.243-250, Jan. 1993.
10. I. Pyo, J. Oh, and M. Pedram, Constructing minimal spanning/Steiner trees with bounded path length, Proc. European Design & Test Conf., pp.244-249, March 1996.
11. J. Rubinstein, P. Penfield, and M.A. Horowitz, Signal delay in RC tree networks, IEEE Trans. Computer-Aided Design, vol.2, no.3, pp.202-211, July 1983.