-
1
-
-
0028733612
-
An edge-based heuristic for steiner routing
-
Dec
-
M. Borah, R. M. Owens, and M. J. Irwin, "An edge-based heuristic for Steiner routing," IEEE Trans. Computer-Aided Design, vol. 13, pp. 1563-1568, Dec. 1994.
-
(1994)
IEEE Trans. Computer-Aided Design
, vol.13
, pp. 1563-1568
-
-
Borah, M.1
Owens, R.M.2
Irwin, M.J.3
-
2
-
-
0000727336
-
The rectilinear steiner tree problem is NP-complete
-
M. R. Garey and D. S. Johnson, "The rectilinear steiner tree problem is NP-complete," SIAM J. Appl. Math, vol. 32, pp. 826-834, 1977.
-
(1977)
SIAM J. Appl. Math
, vol.32
, pp. 826-834
-
-
Garey, M.R.1
Johnson, D.S.2
-
3
-
-
0000814769
-
Steiner's problem with rectilinear distance
-
M. Hanan, "Steiner's problem with rectilinear distance," SIAM J. Appl. Math., vol. 14, pp. 255-265, 1966.
-
(1966)
SIAM J. Appl. Math.
, vol.14
, pp. 255-265
-
-
Hanan, M.1
-
4
-
-
0025384580
-
New algorithms for the rectilinear steiner tree problem
-
Feb
-
J. M. Ho, G. Vijayan, and C. K. Wong, "New algorithms for the rectilinear Steiner tree problem," IEEE Trans. Computer-Aided Design, vol. 9, pp. 185-193, Feb. 1990.
-
(1990)
IEEE Trans. Computer-Aided Design
, vol.9
, pp. 185-193
-
-
Ho, J.M.1
Vijayan, G.2
Wong, C.K.3
-
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, no. 1, pp. 104-114, Jan. 1976.
-
(1976)
SIAM J. Appl. Math.
, vol.30
, Issue.1
, pp. 104-114
-
-
Hwang, F.K.1
-
6
-
-
84863090748
-
Steiner tree problems
-
Jan
-
F. K. Hwang and D. S. Richards, "Steiner tree problems," Networks, vol. 22, no. 1, pp. 55-89 Jan. 1992.
-
(1992)
Networks
, vol.22
, Issue.1
, pp. 55-89
-
-
Hwang, F.K.1
Richards, D.S.2
-
7
-
-
0026898405
-
A new class of iterative steiner tree heuristics with good performance
-
July
-
A. B. Kahng and G. Robins, "A new class of iterative Steiner tree heuristics with good performance," IEEE Trans. Computer-Aided Design, vol. 11, pp. 893-902, July 1992.
-
(1992)
IEEE Trans. Computer-Aided Design
, vol.11
, pp. 893-902
-
-
Kahng, A.B.1
Robins, G.2
-
9
-
-
70350674995
-
On the shortest spanning subtree of a graph
-
J. B. Kruskal, "On the shortest spanning subtree of a graph," in Proc. Amer. Math. Soc., vol. 7, 1956, pp. 48-50.
-
(1956)
Proc. Amer. Math. Soc.
, vol.7
, pp. 48-50
-
-
Kruskal, J.B.1
-
10
-
-
0034292748
-
A new heuristic for rectilinear steiner trees
-
Oct
-
Ion I. Mandoiu, Vijay V. Vazirani, and Joseph L. Ganley, "A new heuristic for rectilinear steiner trees," IEEE Trans. Computer-Aided Design, vol. 19, pp. 1129-1139, Oct. 2000.
-
(2000)
IEEE Trans. Computer-Aided Design
, vol.19
, pp. 1129-1139
-
-
Mandoiu, I.I.1
Vazirani, V.V.2
Ganley, J.L.3
-
11
-
-
0012022513
-
Shortest connecting networks
-
R. C. Prim, "Shortest connecting networks," Bell System Tech. J., vol. 31, pp. 1398-1401, 1957.
-
(1957)
Bell System Tech. J.
, vol.31
, pp. 1398-1401
-
-
Prim, R.C.1
-
12
-
-
84871431980
-
The geosteiner 3.0 package
-
[Online]
-
D. M. Warme, P. Winter, and M. Zacharisen. The geosteiner 3.0 package. [Online]. Available: ftp.diku.dk/diku/users/marginez/geosteiner-3.0.tar.gz.
-
-
-
Warme, D.M.1
Winter, P.2
Zacharisen, M.3
-
13
-
-
0032785133
-
Exact solutions to large-scale plane steiner tree problems
-
D. M. Warme, P. Winter, and M. Zacharisen. "Exact solutions to large-scale plane steiner tree problems," in Proc. 10th Annu. ACM-SIAM Symp. Discrete Algorithms (SODA-99), 1999, pp. 979-980.
-
Proc. 10th Annu. ACM-SIAM Symp. Discrete Algorithms (SODA-99), 1999
, pp. 979-980
-
-
Warme, D.M.1
Winter, P.2
Zacharisen, M.3
|