-
1
-
-
0003415652
-
-
MA: Addison-Wesley
-
A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms Reading, MA: Addison-Wesley, 1974, p. 470.
-
(1974)
The Design and Analysis of Computer Algorithms Reading
, pp. 470
-
-
Aho, A.V.1
Hopcroft, J.E.2
Ullman, J.D.3
-
2
-
-
0000727336
-
The rectilinear Steiner tree problem is NP complete
-
June
-
M. R. Garey and D. S. Johnson, “The rectilinear Steiner tree problem is NP complete,” SIAM J. Appl. Math., vol. 32, pp. 826-834, June 1977.
-
(1977)
SIAM J. Appl. Math.
, vol.32
, pp. 826-834
-
-
Garey, M.R.1
Johnson, D.S.2
-
3
-
-
0000814769
-
On Steiner's problem with rectilinear distance
-
Mar
-
M. Hanan, “On Steiner's problem with rectilinear distance,” SIAM J. Appl. Math., vol. 14, pp. 255-265, Mar. 1966.
-
(1966)
SIAM J. Appl. Math.
, vol.14
, pp. 255-265
-
-
Hanan, M.1
-
4
-
-
35048900175
-
Net wiring for large scale integrated circuits
-
M. Hanan, “Net wiring for large scale integrated circuits,” IBM Res. Rep. RC1375, 1965.
-
(1965)
IBM Res. Rep. RC1375
-
-
Hanan, M.1
-
5
-
-
0016891335
-
On Steiner minimal trees with rectilinear distance
-
Jan.
-
F. K. Hwang, “On Steiner minimal trees with rectilinear distance,” SIAM J. Appl. Math., vol. 30, pp. 104-114, Jan. 1976.
-
(1976)
SIAM J. Appl. Math.
, vol.30
, pp. 104-114
-
-
Hwang, F.K.1
-
7
-
-
0016983068
-
Use of Steiner's problem in Suboptimal routing in rectilinear metric
-
July
-
J. H. Lee, N. K. Bose, and F. K. Hwang, “Use of Steiner's problem in Suboptimal routing in rectilinear metric,” IEEE Trans. Circuits Syst., vol. CAS-23, pp. 470-476, July 1976.
-
(1976)
IEEE Trans. Circuits Syst.
, vol.CAS-23
, pp. 470-476
-
-
Lee, J.H.1
Bose, N.K.2
Hwang, F.K.3
-
8
-
-
70350674995
-
On the shortest spanning subtree of a graph
-
Feb.
-
J. B. Kruskal, “On the shortest spanning subtree of a graph,” Proc. Amer. Math. Soc., vol. 7, pp. 48-50, Feb. 1956.
-
(1956)
Proc. Amer. Math. Soc.
, vol.7
, pp. 48-50
-
-
Kruskal, J.B.1
-
9
-
-
84911584312
-
Shortest connecting networks and some generalizations
-
Nov.
-
R. C. Prim, “Shortest connecting networks and some generalizations,” Bell Syst. Tech. J., vol. 36, pp. 1389-1401, Nov. 1957.
-
(1957)
Bell Syst. Tech. J.
, vol.36
, pp. 1389-1401
-
-
Prim, R.C.1
-
11
-
-
0042979012
-
Optimal and suboptimal solution algorithm for the wiring problem
-
Ph.D. dissertation Columbia Univ.
-
Y. Y. Yang, “Optimal and suboptimal solution algorithm for the wiring problem,” Ph.D. dissertation, Columbia Univ., 1972.
-
(1972)
-
-
Yang, Y.Y.1
-
12
-
-
0015404659
-
Suboptimal algorithm for a wire routing problem
-
Sept.
-
Y. Y. Yang and O. Wing, “Suboptimal algorithm for a wire routing problem,” IEEE Trans. Circuit Theory, vol. CT-19, pp. 508-511, Sept. 1972.
-
(1972)
IEEE Trans. Circuit Theory
, vol.CT-19
, pp. 508-511
-
-
Yang, Y.Y.1
Wing, O.2
|