Login
|
New Account
AAAAAA
ITA
ENG
Results:
1-6
|
Results: 6
An improved approximation scheme for the Group Steiner Problem
Authors:
Helvig, CS Robins, G Zelikovsky, A
Citation:
Cs. Helvig et al., An improved approximation scheme for the Group Steiner Problem, NETWORKS, 37(1), 2001, pp. 8-20
Optimal phase conflict removal for layout of dark field alternating phase shifting masks
Authors:
Berman, P Kahng, AB Vidhani, D Wang, HJ Zelikovsky, A
Citation:
P. Berman et al., Optimal phase conflict removal for layout of dark field alternating phase shifting masks, IEEE COMP A, 19(2), 2000, pp. 175-187
New approximation algorithms for routing with multiport terminals
Authors:
Helvig, CS Robins, G Zelikovsky, A
Citation:
Cs. Helvig et al., New approximation algorithms for routing with multiport terminals, IEEE COMP A, 19(10), 2000, pp. 1118-1128
On approximation of the power-p and bottleneck Steiner trees
Authors:
Berman, P Zelikovsky, A
Citation:
P. Berman et A. Zelikovsky, On approximation of the power-p and bottleneck Steiner trees, COM OPT (S), 6, 2000, pp. 117-135
On wirelength estimations for row-based placement
Authors:
Caldwell, AE Kahng, AB Mantik, S Markov, IL Zelikovsky, A
Citation:
Ae. Caldwell et al., On wirelength estimations for row-based placement, IEEE COMP A, 18(9), 1999, pp. 1265-1278
Filling algorithms and analyses for layout density control
Authors:
Kahng, AB Robins, G Singh, A Zelikovsky, A
Citation:
Ab. Kahng et al., Filling algorithms and analyses for layout density control, IEEE COMP A, 18(4), 1999, pp. 445-462
Risultati:
1-6
|