| Provably good global routing by a new approximation algorithm for multicommodity flow |
| Full text |
Pdf
(182 KB)
|
| Source
|
International Symposium on Physical Design
archive
Proceedings of the 2000 international symposium on Physical design
table of contents
San Diego, California, United States
Pages: 19 - 25
Year of Publication: 2000
ISBN:1-58113-191-7
|
|
Author
|
|
Christoph Albrecht
|
Research Institute for Discrete Mathematics, University of Bonn, Lennéstr. 2, 53113 Bonn, Germany
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 11, Downloads (12 Months): 51, Citation Count: 14
|
|
|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
K. Aoshima and E. S. Kuh. Multi-Channel Optimization in Gate-Array LSI Layout. In Proceedings ISCAS, pages 1005-1008, 1983.
|
 |
2
|
|
 |
3
|
Robert C. Carden, IV , Chung-Kuan Cheng, A global router using an efficient approximate multicommodity multiterminal flow algorithm, Proceedings of the 28th conference on ACM/IEEE design automation, p.316-321, June 17-22, 1991, San Francisco, California, United States
[doi> 10.1145/127601.127687]
|
| |
4
|
|
| |
5
|
W.-M. Dai and E. S. Kuh. Simultaneous Floor Planning and Global Routing for Hierarchical Building- Block Layout. IEEE Transactions on Computer-Aided Design, 6(5):828-837, 1997.
|
| |
6
|
|
| |
7
|
|
| |
8
|
A. Hetzel. Verdrahtungsprobleme im VLSI-Design: Spezielle Teilprobleme und ein sequentielles LSsungsverfahren. Ph.D. Thesis (in German), University of Bonn, 1995.
|
| |
9
|
|
 |
10
|
Jin Huang , Xian-Long Hong , Chung-Kuan Cheng , E. S. Kuh, An efficient timing-driven global routing algorithm, Proceedings of the 30th international conference on Design automation, p.596-600, June 14-18, 1993, Dallas, Texas, United States
[doi> 10.1145/157485.165063]
|
| |
11
|
B. Korte and J. Vygen. Combinatorial Optimization: Theory and Algorithms. Springer-Verlag, Berlin, 2000.
|
| |
12
|
G. Meixner and U. Lauther. A New Global Router Based on A Flow Model and Linear Assignment. In Proceedings of the International Conference on Computer Aided Design, pages 44-47, 1990.
|
| |
13
|
Takumi Okamoto , Masaki Ishikawa , Tomoyuki Fujita, A new feed-through assignment algorithm based on a flow model, Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design, p.775-778, November 07-11, 1993, Santa Clara, California, United States
|
| |
14
|
|
| |
15
|
P. Raghavan and C. D. Thompson. Multiterminal global routing: A deterministic approximation. Algorithmica, 6:73-82, 1991.
|
| |
16
|
A. Rohe and M. Zachariasen. Rectilinear Group Steiner Trees and Application in VLSI-Design. Technical Report, University of Bonn. 2000.
|
| |
17
|
|
CITED BY 16
|
|
|
|
|
|
|
|
Feodor F. Dragan , Andrew B. Kahng , Ion Mandoiu , Sudhakar Muddu , Alexander Zelikovsky, Provably good global buffering by multi-terminal multicommodity flow approximation, Proceedings of the 2001 conference on Asia South Pacific design automation, p.120-125, January 2001, Yokohama, Japan
|
|
|
|
|
|
|
|
|
Tong Jing , Xianlong Hong , Haiyun Bao , Yici Cai , Jingyu Xu , Chungkuan Cheng , Jun Gu, UTACO: a unified timing and congestion optimizing algorithm for standard cell global routing, Proceedings of the 2003 conference on Asia South Pacific design automation, January 21-24, 2003, Kitakyushu, Japan
|
|
|
Yiyu Shi , Paul Mesa , Hao Yu , Lei He, Circuit simulation based obstacle-aware Steiner routing, Proceedings of the 43rd annual conference on Design automation, July 24-28, 2006, San Francisco, CA, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|