-
2
-
-
85176695123
-
-
R. C. Carden IV, J. Li and C.-K. Cheng, A global router with a theoretical bound on the optimum solution, in IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems, 15, pp. 208-216, 1996.
-
R. C. Carden IV, J. Li and C.-K. Cheng, "A global router with a theoretical bound on the optimum solution", in IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems, vol. 15, pp. 208-216, 1996.
-
-
-
-
3
-
-
84981632113
-
The Steiner problem in graphs
-
S. E. Dreyfus and R. A. Wagner, "The Steiner problem in graphs", in Networks, vol. 1, pp. 195-207, 1972.
-
(1972)
Networks
, vol.1
, pp. 195-207
-
-
Dreyfus, S.E.1
Wagner, R.A.2
-
6
-
-
0035513318
-
A survey on multi-net global routing for integrated circuits
-
J. Hu and S. S. Sapatnekar, "A survey on multi-net global routing for integrated circuits", in Integration, the VLSI Journal, vol. 31, pp. 1-49, 2001.
-
(2001)
Integration, the VLSI Journal
, vol.31
, pp. 1-49
-
-
Hu, J.1
Sapatnekar, S.S.2
-
7
-
-
1642334103
-
Utaco: A unified timing and congestion optimizing algorithm for standard cell global routing
-
T. Jing, X. Hong, H. Bao, Y. Cai, J. Xu, C. Cheng and J. Gu, "Utaco: A unified timing and congestion optimizing algorithm for standard cell global routing", in Proceedings of the Asia and South Pacific Design Automation Conference, pp. 834-839, 2003.
-
(2003)
Proceedings of the Asia and South Pacific Design Automation Conference
, pp. 834-839
-
-
Jing, T.1
Hong, X.2
Bao, H.3
Cai, Y.4
Xu, J.5
Cheng, C.6
Gu, J.7
-
8
-
-
27644592104
-
Modeling of lithography related yield losses for CAD of VLSI circuits
-
July
-
W. Maly, "Modeling of lithography related yield losses for CAD of VLSI circuits", IEEE Transactions on Computer-Aided Design, vol. CAD-4, pp. 166-177, July 1985.
-
(1985)
IEEE Transactions on Computer-Aided Design
, vol.CAD-4
, pp. 166-177
-
-
Maly, W.1
-
9
-
-
46149087222
-
-
P. Raghavan, Randomized rounding and discrete ham-sandwich theorems: provably good algorithms for routing and packing problems, Ph.D. thesis, Report No. UCB/CSD 87/312, University of California, Berkeley, 1986.
-
P. Raghavan, "Randomized rounding and discrete ham-sandwich theorems: provably good algorithms for routing and packing problems", Ph.D. thesis, Report No. UCB/CSD 87/312, University of California, Berkeley, 1986.
-
-
-
-
10
-
-
51249173817
-
Randomized rounding: A technique for provably good algorithms and algorithmic proofs
-
P. Raghavan and C. D. Thompson, "Randomized rounding: a technique for provably good algorithms and algorithmic proofs", in Combinatorica, vol. 7, pp. 365-374, 1987.
-
(1987)
Combinatorica
, vol.7
, pp. 365-374
-
-
Raghavan, P.1
Thompson, C.D.2
-
11
-
-
0025415365
-
The maximum concurrent flow problem
-
F. Shahrokhi and D. W. Matula, "The maximum concurrent flow problem", in Journal of the ACM, vol. 37, pp. 318-334, 1990.
-
(1990)
Journal of the ACM
, vol.37
, pp. 318-334
-
-
Shahrokhi, F.1
Matula, D.W.2
-
12
-
-
35048859722
-
Near Optimum Global Routing with Coupling, Delay Bounds, and Power Consumption
-
G. Nemhauser, D. Bienstock, eds, pp, Springer, Berlin
-
J. Vygen, "Near Optimum Global Routing with Coupling, Delay Bounds, and Power Consumption", in Integer Programming and Combinatorial Optimization; Proceedings of the 10th International IPCO Conference; LNCS 3064 (G. Nemhauser, D. Bienstock, eds.), pp. 308-324, Springer, Berlin 2004.
-
(2004)
Integer Programming and Combinatorial Optimization; Proceedings of the 10th International IPCO Conference; LNCS
, vol.3064
, pp. 308-324
-
-
Vygen, J.1
-
13
-
-
7944236820
-
A novel timing-driven global routing algorithm considering coupling effects for high performance circuit design
-
J. Xu, X. Hong, T. Jing, Y. Cai and J. Gu, "A novel timing-driven global routing algorithm considering coupling effects for high performance circuit design", in Proceedings of the Asia and South Pacific Design Automation Conference, pp. 847-850, 2003.
-
(2003)
Proceedings of the Asia and South Pacific Design Automation Conference
, pp. 847-850
-
-
Xu, J.1
Hong, X.2
Jing, T.3
Cai, Y.4
Gu, J.5
|