-
2
-
-
0032156828
-
Polynomial time approximation scheme for Euclidean traveling salesman and other geometric problems
-
S. ARORA, Polynomial time approximation scheme for Euclidean traveling salesman and other geometric problems, J. ACM, 45 (1998), pp. 753-782.
-
(1998)
J. ACM
, vol.45
, pp. 753-782
-
-
Arora, S.1
-
3
-
-
0030674260
-
Min-cost flow based min-cost rectilinear Steiner distance preserving tree construction
-
ACM Press, New York
-
J. D. CHO, Min-cost flow based min-cost rectilinear Steiner distance preserving tree construction, in Proceedings of the International Symposium on Physical Design, ACM Press, New York, 1997, pp. 82-87.
-
(1997)
Proceedings of the International Symposium on Physical Design
, pp. 82-87
-
-
Cho, J.D.1
-
4
-
-
0031705566
-
Efficient algorithms for the minimum shortest path Steiner arborescence problem with applications to VLSI physical design
-
J. CONG, A. B. KAHNG, AND K. S. LEUNG, Efficient algorithms for the minimum shortest path Steiner arborescence problem with applications to VLSI physical design, IEEE Trans. Computer-Aided Design, 17 (1998), pp. 24-39.
-
(1998)
IEEE Trans. Computer-aided Design
, vol.17
, pp. 24-39
-
-
Cong, J.1
Kahng, A.B.2
Leung, K.S.3
-
5
-
-
0027206875
-
Performance driven interconnect design based on distributed RC delay model
-
J. CONG, K. S. LEUNG, AND D. ZHOU, Performance driven interconnect design based on distributed RC delay model, in Proceedings of the 30th ACM/IEEE Design Automation Conference, 1993, pp. 606-611.
-
(1993)
Proceedings of the 30th ACM/IEEE Design Automation Conference
, pp. 606-611
-
-
Cong, J.1
Leung, K.S.2
Zhou, D.3
-
6
-
-
0038764870
-
A heuristic algorithm for the rectilinear steiner arborescence problem
-
Department of Computer Science, University of Florida, Gainesville, FL
-
J. CÓRDOVA AND Y. H. LEE, A Heuristic Algorithm for the Rectilinear Steiner Arborescence Problem, Technical Report TR-94-025, Department of Computer Science, University of Florida, Gainesville, FL, 1994.
-
(1994)
Technical Report
, vol.TR-94-025
-
-
Córdova, J.1
Lee, Y.H.2
-
7
-
-
33745469353
-
-
private communication
-
A. ERZIN AND A. KAHNG, private communication.
-
-
-
Erzin, A.1
Kahng, A.2
-
9
-
-
0003689279
-
-
North-Holland, Amsterdam
-
F. K. HWANG, D. S. RICHARDS, AND P. WINTER, The Steiner Tree Problem, North-Holland, Amsterdam, 1992.
-
(1992)
The Steiner Tree Problem
-
-
Hwang, F.K.1
Richards, D.S.2
Winter, P.3
-
10
-
-
33745448535
-
-
Ph.D. dissertation, University of Alabama, Tuscaloosa, AL
-
R. R. LADERIA DE MATOS, A Rectilinear Arborescence Problem, Ph.D. dissertation, University of Alabama, Tuscaloosa, AL, 1979.
-
(1979)
A Rectilinear Arborescence Problem
-
-
Laderia De Matos, R.R.1
-
11
-
-
0002794707
-
Planar formulae and their uses
-
D. LICHTENSTEIN, Planar formulae and their uses, SIAM J. Comput., 11 (1982), pp. 329-343.
-
(1982)
SIAM J. Comput.
, vol.11
, pp. 329-343
-
-
Lichtenstein, D.1
-
12
-
-
0038088241
-
Polynomial time approximation scheme for rectilinear Steiner arbores-cence problem
-
B. LU AND L. RUAN, Polynomial time approximation scheme for rectilinear Steiner arbores-cence problem, J. Comb. Optim., 4 (2000), pp. 357-363.
-
(2000)
J. Comb. Optim.
, vol.4
, pp. 357-363
-
-
Lu, B.1
Ruan, L.2
-
13
-
-
0038764866
-
Cost-minima trees in directed acyclic graphs
-
L. NASTANSKY, S. M. SELKOW, AND N. F. STEWART, Cost-minima trees in directed acyclic graphs, Z. Operations Res. Ser. A-B, 18 (1974), pp. 59-67.
-
(1974)
Z. Operations Res. Ser. A-B
, vol.18
, pp. 59-67
-
-
Nastansky, L.1
Selkow, S.M.2
Stewart, N.F.3
-
14
-
-
0026627087
-
The rectilinear Steiner arborescence problem
-
S. K. RAO, P. SADAYAPPAN, F. K. HWANG, AND P. W. SHOR, The rectilinear Steiner arborescence problem, Algorithmica, 7 (1992), pp. 277-288.
-
(1992)
Algorithmica
, vol.7
, pp. 277-288
-
-
Rao, S.K.1
Sadayappan, P.2
Hwang, F.K.3
Shor, P.W.4
-
15
-
-
0037750603
-
Subclass of the Steiner problems on a plane with rectilinear metric
-
V. A. TRUBIN, Subclass of the Steiner problems on a plane with rectilinear metric, Cybernetics, 21 (1985), pp. 320-322.
-
(1985)
Cybernetics
, vol.21
, pp. 320-322
-
-
Trubin, V.A.1
-
16
-
-
0019532794
-
Universality considerations in VLSI circuits
-
L. VALIANT, Universality considerations in VLSI circuits, IEEE Trans. Comput., 30 (1981), pp. 135-140.
-
(1981)
IEEE Trans. Comput.
, vol.30
, pp. 135-140
-
-
Valiant, L.1
|