Geodesic
Max Length Driven Global Routing (in Armenian)
Proceedings of the Yerevan State University. Physical and mathematical sciences, no. 1 (2006), pp. 49-57 
G. A. Mkrtchyan. Max Length Driven Global Routing (in Armenian). Proceedings of the Yerevan State University. Physical and mathematical sciences, no. 1 (2006), pp. 49-57. http://geodesic.mathdoc.fr/item/UZERU_2006_1_a4/
@article{UZERU_2006_1_a4,
     author = {G. A. Mkrtchyan},
     title = {Max {Length} {Driven} {Global} {Routing} (in {Armenian)}},
     journal = {Proceedings of the Yerevan State University. Physical and mathematical sciences},
     pages = {49--57},
     year = {2006},
     number = {1},
     language = {hy},
     url = {http://geodesic.mathdoc.fr/item/UZERU_2006_1_a4/}
}
TY  - JOUR
AU  - G. A. Mkrtchyan
TI  - Max Length Driven Global Routing (in Armenian)
JO  - Proceedings of the Yerevan State University. Physical and mathematical sciences
PY  - 2006
SP  - 49
EP  - 57
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/UZERU_2006_1_a4/
LA  - hy
ID  - UZERU_2006_1_a4
ER  - 
%0 Journal Article
%A G. A. Mkrtchyan
%T Max Length Driven Global Routing (in Armenian)
%J Proceedings of the Yerevan State University. Physical and mathematical sciences
%D 2006
%P 49-57
%N 1
%U http://geodesic.mathdoc.fr/item/UZERU_2006_1_a4/
%G hy
%F UZERU_2006_1_a4

Voir la notice de l'article provenant de la source Math-Net.Ru

In order to maintain signal integrity and reasonable delay in high frequent designs, each critical net must undergo buffer insertion. At the same time a big number of nets in such designs create restrictions in terms of algorithms' run time. This paper studies the problem of constructing minimum cost buffered routing trees in high utilized and congested designs with possible buffer locations.

[1] L. Minghorng, D.F. Wong, “Maze Routing with Buffer Insertion and Wiresizing”, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2000, 374–378

[2] Ch. Alpert, A. B. Kahng,Liu Bao, Ion Mandoiu, A. Zelikovsky, “Minimum-Buffered Routing of Non-Critical Nets for Slew Rate and Reliability Control”, Proc. IEEE-ACM Inti. Conf. on Computer-Aided Design, 2001, 408–415

[3] J. Cong, Xin Yuan, “Routing Tree Construction Under Fixed Buffer Locations”, Proc. IEEE- ACM Inti. Conf. on Computer-Aided Design, 2000, 379–384

[4] N.A. Shervani, Algorithms for VLSI Physical Design Automation, ed. 3rd edition, Kluwer Academic Publishers, 1999

[5] A.B. Kahng, G. Robins, On Optimal Interconnections for VLSI, KJuwler Academic Publishers, 2001 | MR

[6] W.C. Elmore, “The Transient Response of Damped Linear Networks with Particular Regard to Wideband Amplifiers”, J. Appl. Phys., 19 (1948), 55–62 | DOI

[7] G.A. Mkrtchyan, Information Technologies and Management, 2005, no. 2

[8] R. Kastner, E. Bozogzadeh, M. Sarrafzadeh, “An exact algorithm for coupling-free routing”, Proc. Int. Symp. on Physical Design (Sonoma, CA), 2001, 10–15