{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T19:13:44Z","timestamp":1774725224063,"version":"3.50.1"},"reference-count":310,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":5397,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1992,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We give a survey up to 1989 on the Steiner tree problems which include the four important cases of euclidean, rectilinear, graphic, phylogenetic and some of their generalizations. We also provide a rather comprehensive and up\u2010to\u2010date bibliography which covers more than three hundred items.<\/jats:p>","DOI":"10.1002\/net.3230220105","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T12:18:37Z","timestamp":1178972317000},"page":"55-89","source":"Crossref","is-referenced-by-count":524,"title":["Steiner tree problems"],"prefix":"10.1002","volume":"22","author":[{"given":"F. K.","family":"Hwang","sequence":"first","affiliation":[]},{"given":"Dana S.","family":"Richards","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230200407"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230070104"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230100207"},{"key":"e_1_2_1_5_2","first-page":"38","volume-title":"Problems easy for tree\u2010decomposable graphs. Automata Languages and Programming [LNCS 317]","author":"Arnborg S.","year":"1988"},{"key":"e_1_2_1_6_2","volume-title":"Le Probleme de Steiner sur un Graphe Oriente: Formulations and Relaxations","author":"Arpin D.","year":"1983"},{"key":"e_1_2_1_7_2","series-title":"Monograph 9","volume-title":"An Atlas of Steiner Networks","author":"Arlinghaus S. L.","year":"1989"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(86)90018-8"},{"key":"e_1_2_1_9_2","unstructured":"A.Balakrishnan Formulations and algorithms for the Steiner network problem. Unpublished manuscript Sloan School Management MIT (1982)."},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230170107"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(88)90058-2"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100034095"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140112"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230190102"},{"key":"e_1_2_1_15_2","unstructured":"J. E.Beasley A heuristic for the Euclidean and rectilinear Steiner problems. Working Paper Management School Imperial College London (1989)."},{"key":"e_1_2_1_16_2","unstructured":"M. W.Bern Network design problems: Steiner trees and spanning k\u2010trees. PhD Dissertation Computer Science Division University of California at Berkeley (1987)."},{"key":"e_1_2_1_17_2","doi-asserted-by":"crossref","unstructured":"M. W.Bern Two probabilistic results on rectilinear Steiner trees.Algorithmica(1988)191\u2013204.","DOI":"10.1007\/BF01762114"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230200110"},{"key":"e_1_2_1_19_2","unstructured":"M.BernandD.Bienstock Further polynomially solvable special cases of the Steiner problem in planar graphs. Preprint (1989)."},{"key":"e_1_2_1_20_2","unstructured":"M. W.BernandM.de Carvalho A greedy heuristic for the rectilinear Steiner tree problem. Technical Report Computer Science Division University of California at Berkeley (1985)."},{"key":"e_1_2_1_21_2","doi-asserted-by":"crossref","unstructured":"M. W.BernandR. L.Graham The shortest\u2010network problem. Sci. Am.January (1989)84\u201389.","DOI":"10.1038\/scientificamerican0189-84"},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(89)90039-2"},{"key":"e_1_2_1_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1983.1095818"},{"key":"e_1_2_1_24_2","unstructured":"S.Bhaskaran Optimal design of gas pipeline networks. PhD Dissertation University of Adelaide Australia (1978)."},{"key":"e_1_2_1_25_2","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1979.240"},{"key":"e_1_2_1_26_2","doi-asserted-by":"publisher","DOI":"10.1137\/0217004"},{"key":"e_1_2_1_27_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230190107"},{"key":"e_1_2_1_28_2","article-title":"On the complexity of embedding planar graphs to minimize certain distance measures","author":"Bienstock D.","journal-title":"Algorithmica"},{"key":"e_1_2_1_29_2","first-page":"103","volume-title":"Automata, Languages and Programming","author":"Bodlaender H. L.","year":"1988"},{"key":"e_1_2_1_30_2","first-page":"1","volume-title":"Graph\u2010Theoretic Concepts in Computer Science","author":"Bodlaender H. L.","year":"1988"},{"key":"e_1_2_1_31_2","article-title":"Analytic formulas for full Steiner trees","author":"Booth R. S.","journal-title":"Disc. Comput. Geom."},{"key":"e_1_2_1_32_2","article-title":"The Steiner ratio for five points","author":"Booth R. S.","journal-title":"Ann. Oper. Res."},{"key":"e_1_2_1_33_2","unstructured":"R.Borie R. G.Parker andC. A.Tovey Recursively constructed graphs: decomposition and linear\u2010time algorithm generation. Preprint (1989)."},{"key":"e_1_2_1_34_2","unstructured":"W. M.BoyceandJ. B.Seery STEINER72: An improved version of the minimal network problem. Technical Report 35 Comp. Sci. Res. Ctr. Bell Labs (1975)."},{"key":"e_1_2_1_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/355759.355764"},{"key":"e_1_2_1_36_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1558-5646.1965.tb01722.x"},{"key":"e_1_2_1_37_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00122-008-0801-8"},{"key":"e_1_2_1_38_2","doi-asserted-by":"publisher","DOI":"10.3109\/10409238109108699"},{"key":"e_1_2_1_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/321724.321733"},{"key":"e_1_2_1_40_2","unstructured":"S.\u2010K.Chang The design of network configurations with linear or piecewise linear cost functions.Symp. Comput. Commun. Networks Teletraffic(1972)363\u2013369."},{"key":"e_1_2_1_41_2","unstructured":"N.\u2010P.Chen New algorithm for Steiner tree on graphs.IEEE Symp Circuits Syst.(1983)1217\u20131219."},{"key":"e_1_2_1_42_2","doi-asserted-by":"publisher","DOI":"10.1137\/0134020"},{"key":"e_1_2_1_43_2","unstructured":"C.Chiang M.Sarrafzadeh andC. K.Wong A powerful global router: Based on Steiner min\u2010max trees. Preprint (1989)."},{"key":"e_1_2_1_44_2","doi-asserted-by":"publisher","DOI":"10.2307\/2690388"},{"key":"e_1_2_1_45_2","first-page":"313","article-title":"Steiner trees for the regular simplex","volume":"4","author":"Chung F. R. K.","year":"1976","journal-title":"Bull. Inst. Math. Acad. Sinica"},{"key":"e_1_2_1_46_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70332-7"},{"key":"e_1_2_1_47_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00149359"},{"key":"e_1_2_1_48_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1749-6632.1985.tb14564.x"},{"key":"e_1_2_1_49_2","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-386870-1.50026-5"},{"key":"e_1_2_1_50_2","doi-asserted-by":"publisher","DOI":"10.1137\/0134003"},{"key":"e_1_2_1_51_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230090103"},{"key":"e_1_2_1_52_2","doi-asserted-by":"publisher","DOI":"10.1088\/0031-9120\/16\/1\/005"},{"key":"e_1_2_1_53_2","volume-title":"Une nouvelle formulation du probleme de Steiner sur un graphe","author":"Claus A.","year":"1983"},{"key":"e_1_2_1_54_2","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-1967-041-8"},{"key":"e_1_2_1_55_2","doi-asserted-by":"publisher","DOI":"10.1137\/0118014"},{"key":"e_1_2_1_56_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(86)90062-1"},{"key":"e_1_2_1_57_2","article-title":"Leaf paths of full Steiner trees and computation of planar Steiner minimal trees","author":"Cockayne E. J.","journal-title":"Algorithmica"},{"key":"e_1_2_1_58_2","unstructured":"E. J.CockayneandD. E.Hewgill Improved computation of plane Steiner minimal trees. Preprint (1989)."},{"key":"e_1_2_1_59_2","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1090\/qam\/233286","article-title":"Steiner's problem for set\u2010terminals","volume":"26","author":"Cockayne E. J.","year":"1967","journal-title":"Q. Appl. Math."},{"key":"e_1_2_1_60_2","doi-asserted-by":"publisher","DOI":"10.2307\/2688541"},{"key":"e_1_2_1_61_2","first-page":"203","article-title":"MEST82, A program for minimal full Steiner trees in the plane","volume":"39","author":"Cockayne E. J.","year":"1983","journal-title":"Congressus Numeratium (Proc. 14th S. E. Conf. on Combinatorics, Graph Theory and Computing)"},{"key":"e_1_2_1_62_2","first-page":"53","volume-title":"Combinatorics","author":"Cockayne E. J.","year":"1972"},{"key":"e_1_2_1_63_2","doi-asserted-by":"publisher","DOI":"10.1109\/43.45871"},{"key":"e_1_2_1_64_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90359-P"},{"key":"e_1_2_1_65_2","unstructured":"G.Cornuejols J.Fonlupt andD.Naddef The graphical travelling salesman problem and some related integer polyhedra. Research Report 378 Appliquees de Grenoble (1983)."},{"key":"e_1_2_1_66_2","volume-title":"What Is Mathematics?","author":"Courant R.","year":"1941"},{"key":"e_1_2_1_67_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(89)90216-0"},{"key":"e_1_2_1_68_2","doi-asserted-by":"publisher","DOI":"10.1137\/0217032"},{"key":"e_1_2_1_69_2","doi-asserted-by":"crossref","unstructured":"A.D'Atri M.Moscarini andA.Sassano The Steiner tree problem and homogeneous sets.Math. Foundations Comput. Sci.[LNCS 324] (1988)249\u2013261.","DOI":"10.1007\/BFb0017148"},{"key":"e_1_2_1_70_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-5193(83)90296-5"},{"key":"e_1_2_1_71_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0092-8240(87)80007-1"},{"key":"e_1_2_1_72_2","doi-asserted-by":"publisher","DOI":"10.2307\/2413432"},{"key":"e_1_2_1_73_2","doi-asserted-by":"publisher","DOI":"10.1016\/0025-5564(86)90161-6"},{"key":"e_1_2_1_74_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-5193(87)80263-1"},{"key":"e_1_2_1_75_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230010302"},{"key":"e_1_2_1_76_2","unstructured":"J.Dolan R.Weiss andJ. M.Smith Minimal length trees on the unit sphere. Preprint (1989)."},{"key":"e_1_2_1_77_2","first-page":"266","article-title":"Directed Steiner tree problem on a graph: Models, relaxations and algorithms","volume":"28","author":"Dror M.","year":"1990","journal-title":"INFOR"},{"key":"e_1_2_1_78_2","article-title":"On Steiner ratio conjectures","author":"Du D. Z.","journal-title":"Ann. Oper. Res."},{"key":"e_1_2_1_79_2","doi-asserted-by":"publisher","DOI":"10.2307\/1999306"},{"key":"e_1_2_1_80_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230160105"},{"key":"e_1_2_1_81_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02007669"},{"key":"e_1_2_1_82_2","doi-asserted-by":"publisher","DOI":"10.2307\/2045853"},{"key":"e_1_2_1_83_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187892"},{"key":"e_1_2_1_84_2","doi-asserted-by":"publisher","DOI":"10.2307\/1999307"},{"key":"e_1_2_1_85_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187871"},{"key":"e_1_2_1_86_2","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(85)90073-1"},{"key":"e_1_2_1_87_2","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(82)90056-5"},{"key":"e_1_2_1_88_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230170309"},{"key":"e_1_2_1_89_2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(89)90005-9"},{"key":"e_1_2_1_90_2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(89)90170-7"},{"key":"e_1_2_1_91_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230190506"},{"key":"e_1_2_1_92_2","article-title":"The multiweighted Steiner tree problem","author":"Duin C. W.","journal-title":"Ann. Oper. Res."},{"key":"e_1_2_1_93_2","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1051\/ro\/1978120202071","article-title":"Une heuristique pour le probleme de l'Arbre de Steiner (in French)","volume":"12","author":"El\u2010Arbi C.","year":"1978","journal-title":"RAIRO (Operations Res.)"},{"key":"e_1_2_1_94_2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.12.4.634"},{"key":"e_1_2_1_95_2","doi-asserted-by":"publisher","DOI":"10.1137\/0601010"},{"key":"e_1_2_1_96_2","doi-asserted-by":"publisher","DOI":"10.2307\/2412028"},{"key":"e_1_2_1_97_2","doi-asserted-by":"publisher","DOI":"10.1086\/412935"},{"key":"e_1_2_1_98_2","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.ge.22.120188.002513"},{"key":"e_1_2_1_99_2","doi-asserted-by":"publisher","DOI":"10.1112\/S0025579300000784"},{"key":"e_1_2_1_100_2","doi-asserted-by":"publisher","DOI":"10.2307\/2412116"},{"key":"e_1_2_1_101_2","doi-asserted-by":"publisher","DOI":"10.1086\/283157"},{"key":"e_1_2_1_102_2","first-page":"1","article-title":"Testing the theory of evolution","volume":"10","author":"Foulds L. R.","year":"1983","journal-title":"Optima"},{"key":"e_1_2_1_103_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-5193(84)80103-4"},{"key":"e_1_2_1_104_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(86)90048-X"},{"key":"e_1_2_1_105_2","unstructured":"L. R.FouldsandP. B.Gibbons A branch and bound approach to the Steiner problem in graphs. Proceedings of the 14th Annual Conference of the Operational Research Society of New Zealand (1978) Vol. 1 61\u201370."},{"key":"e_1_2_1_106_2","first-page":"215","article-title":"Algorithms for the Steiner problem in graphs","volume":"6","author":"Foulds L. R.","year":"1981","journal-title":"J. Combin. Inf. Syst. Sci."},{"key":"e_1_2_1_107_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-8858(82)80004-3"},{"key":"e_1_2_1_108_2","doi-asserted-by":"publisher","DOI":"10.1080\/03052158308960625"},{"key":"e_1_2_1_109_2","doi-asserted-by":"publisher","DOI":"10.1137\/0149057"},{"key":"e_1_2_1_110_2","unstructured":"Y.Fu Application of linear graph theory to printed circuits.Proc. Asilomar Conf. Syst. Circuits(1967)721\u2013728."},{"key":"e_1_2_1_111_2","doi-asserted-by":"publisher","DOI":"10.1080\/01468037808240539"},{"key":"e_1_2_1_112_2","doi-asserted-by":"crossref","unstructured":"M.Gardner Mathematical games. Sci. Am.June (1986)16\u201322.","DOI":"10.1038\/scientificamerican0686-16"},{"key":"e_1_2_1_113_2","doi-asserted-by":"publisher","DOI":"10.1137\/0132072"},{"key":"e_1_2_1_114_2","doi-asserted-by":"publisher","DOI":"10.1137\/0132071"},{"key":"e_1_2_1_115_2","volume-title":"Computers and Intractability","author":"Garey M. R.","year":"1979"},{"key":"e_1_2_1_116_2","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(87)90032-0"},{"key":"e_1_2_1_117_2","doi-asserted-by":"publisher","DOI":"10.1137\/0113021"},{"key":"e_1_2_1_118_2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1967.tb04250.x"},{"key":"e_1_2_1_119_2","doi-asserted-by":"publisher","DOI":"10.1137\/0116001"},{"key":"e_1_2_1_120_2","unstructured":"M. X.GoemansandD. J.Bertsimas On the parsimonious property of connectivity problems. Working Paper Sloan School MIT (1989)."},{"key":"e_1_2_1_121_2","doi-asserted-by":"publisher","DOI":"10.1016\/0025-5564(82)90125-0"},{"key":"e_1_2_1_122_2","first-page":"177","article-title":"Remarks on Steiner minimal trees I","volume":"4","author":"Graham R. L.","year":"1976","journal-title":"Bull. Inst. Math. Acad. Sinica"},{"key":"e_1_2_1_123_2","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/12.14.5837"},{"key":"e_1_2_1_124_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230010203"},{"key":"e_1_2_1_125_2","unstructured":"S.HambruschandL.TeWinkel Parallel heuristics for the Steiner tree problem in images without sorting or routing. Technical Report 89\u2010048 Computer Science Dept. Purdue University (1989)."},{"key":"e_1_2_1_126_2","unstructured":"M.Hanan Net wiring for large scale integrated circuits. RC 1375. IBM Research Report (1965)."},{"key":"e_1_2_1_127_2","doi-asserted-by":"publisher","DOI":"10.1137\/0114025"},{"key":"e_1_2_1_128_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCT.1972.1083408"},{"key":"e_1_2_1_129_2","doi-asserted-by":"publisher","DOI":"10.2307\/2529676"},{"key":"e_1_2_1_130_2","doi-asserted-by":"publisher","DOI":"10.1016\/0025-5564(82)90027-X"},{"key":"e_1_2_1_131_2","doi-asserted-by":"publisher","DOI":"10.1016\/0025-5564(68)90092-8"},{"key":"e_1_2_1_132_2","unstructured":"J.Hesser R.Manner andO.Stucky Optimization of Steiner trees using genetic algorithms.Proceedings of the Third International Conference on Genetic Algorithms(1989)231\u2013236."},{"key":"e_1_2_1_133_2","doi-asserted-by":"crossref","unstructured":"J.\u2010M.Ho G.Vijayan andC. K.Wong A new approach to the rectilinear Steiner tree problem Proceedings of the 26th Design Automation Conference(1989)161\u2013166.","DOI":"10.1145\/74382.74410"},{"key":"e_1_2_1_134_2","unstructured":"J.\u2010M.Ho G.Vijayan andC. K.Wong Constructing the optimal rectilinear Steiner tree derived from a minimum spanning tree.Digest of Tech. PapersICCAD\u201089 (1989)6\u20139."},{"key":"e_1_2_1_135_2","unstructured":"A. D.Howard Theoretical model to optimal drainage. To appear."},{"key":"e_1_2_1_136_2","doi-asserted-by":"crossref","unstructured":"Y. C.Hsu Y.Pan andW. J.Kubitz A path selection global router.24th ACM\/IEEE Design Automation Conference(1987)641\u2013644.","DOI":"10.1145\/37888.37990"},{"key":"e_1_2_1_137_2","doi-asserted-by":"publisher","DOI":"10.1137\/0130013"},{"key":"e_1_2_1_138_2","first-page":"303","article-title":"The rectilinear Steiner problem","volume":"3","author":"Hwang F. K.","year":"1978","journal-title":"Design Automation Fault Tolerant Comput."},{"key":"e_1_2_1_139_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCS.1979.1084551"},{"key":"e_1_2_1_140_2","doi-asserted-by":"publisher","DOI":"10.1145\/322123.322124"},{"key":"e_1_2_1_141_2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(86)90008-8"},{"key":"e_1_2_1_142_2","article-title":"Steiner minimal trees on the Chinese checkerboard","author":"Hwang F. K.","journal-title":"Math. Mag."},{"key":"e_1_2_1_143_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187919"},{"key":"e_1_2_1_144_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(86)90040-3"},{"key":"e_1_2_1_145_2","unstructured":"F. K.HwangandJ. F.Weng Shortest networks with a given topology. Preprint."},{"key":"e_1_2_1_146_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(83)90179-6"},{"key":"e_1_2_1_147_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840406"},{"key":"e_1_2_1_148_2","unstructured":"A.Iwainsky Some notes on the Steiner tree problem in graphs.Optimization of Connection Structures in Graphs(A. Iwainsky Ed.). Centr. Inst. of Cyb. a. Inform. Processes Berlin (1985)57\u201373."},{"key":"e_1_2_1_149_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230160209"},{"key":"e_1_2_1_150_2","unstructured":"A.IwainskyandA.Nuemann Some variants of a heuristic approach to the solution of the Steiner tree problem in graphs to appear."},{"key":"e_1_2_1_151_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230190705"},{"key":"e_1_2_1_152_2","unstructured":"A.Jain The Steiner problem on directed graphs: A probabilistic analysis of the duality gap. Preprint (1989)."},{"key":"e_1_2_1_153_2","first-page":"223","article-title":"O minim\u00e1lnich gratech obsahujicich n dan\u00fdch bodu [in Czech]","volume":"63","author":"Jarnik V.","year":"1934","journal-title":"Casopis Pesk. Mat. Fyr."},{"key":"e_1_2_1_154_2","first-page":"343","article-title":"An algorithm for generating rectilinear Steiner trees [in Chinese]","volume":"25","author":"Jiang J. W.","year":"1986","journal-title":"J. Fudan Univ. (Natural Sci.)"},{"key":"e_1_2_1_155_2","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(85)90012-4"},{"key":"e_1_2_1_156_2","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(87)90021-6"},{"key":"e_1_2_1_157_2","unstructured":"B.Johnston An empirical study of exact algorithms for the cardinality Steiner problem. Master's Thesis Simon Fraser University Burnaby B.C. Canada (1987)."},{"key":"e_1_2_1_158_2","volume-title":"An Artificial Intelligence Approach to VLSI Routing","author":"Joobbani R.","year":"1986"},{"key":"e_1_2_1_159_2","doi-asserted-by":"publisher","DOI":"10.1002\/sapm1973522141"},{"key":"e_1_2_1_160_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_2_1_161_2","first-page":"1","volume-title":"Algorithms and Complexity: New Directions and Recent Results","author":"Karp R. M.","year":"1976"},{"key":"e_1_2_1_162_2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2.3.209"},{"key":"e_1_2_1_163_2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(81)90203-4"},{"key":"e_1_2_1_164_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230150403"},{"key":"e_1_2_1_165_2","first-page":"349","volume-title":"Survey of Math Programming (Proc 9th Int. Math. Prog. Symp.)","author":"Korhonen P.","year":"1979"},{"key":"e_1_2_1_166_2","volume-title":"Mathematick\u00e9 Met\u00f3dy v. Hospod\u00e1rsky Praxi","author":"Kotzig A.","year":"1961"},{"key":"e_1_2_1_167_2","first-page":"369","article-title":"On efficient implementation of an approximation algorithm for the Steiner tree problem","volume":"27","author":"Kou L. T.","year":"1990","journal-title":"Acta Info."},{"key":"e_1_2_1_168_2","first-page":"147","article-title":"An even faster approximation algorithm for the Steiner tree problem in graphs","volume":"59","author":"Kou L. T.","year":"1987","journal-title":"Congressus Numerantium"},{"key":"e_1_2_1_169_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288961"},{"key":"e_1_2_1_170_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0016276"},{"key":"e_1_2_1_171_2","first-page":"98","volume-title":"Studies in Optimization","author":"Kuhn H. W.","year":"1975"},{"key":"e_1_2_1_172_2","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler E. L.","year":"1976"},{"key":"e_1_2_1_173_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230060405"},{"key":"e_1_2_1_174_2","doi-asserted-by":"publisher","DOI":"10.1137\/0209017"},{"key":"e_1_2_1_175_2","unstructured":"D.Lee Some industrial case studies of Steiner trees. Preprint (1989)."},{"key":"e_1_2_1_176_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCS.1976.1084243"},{"key":"e_1_2_1_177_2","doi-asserted-by":"crossref","unstructured":"K.\u2010W.LeeandC.Sechen A new global router for row\u2010based layout.IEEE Int. Conf. Computer\u2010Aided Design(1988)180\u2013183.","DOI":"10.1109\/ICCAD.1988.122489"},{"key":"e_1_2_1_178_2","unstructured":"A. Ju.Levin The shortest connection of a group of graph vertices[in Russian].Proc. of the Inst. of Math. Voronez State University(1970)6\u201317."},{"key":"e_1_2_1_179_2","first-page":"1477","article-title":"Algorithm for the shortest connection of a group of graph vertices","volume":"12","author":"Levin A. Ju.","year":"1971","journal-title":"Soviet Math. Doklady"},{"key":"e_1_2_1_180_2","unstructured":"A.Liestman Construction of Steiner trees with obstacles in the plane. Masters Thesis Dept. Computer Science University of Illinois (1978)."},{"key":"e_1_2_1_181_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(87)90021-7"},{"key":"e_1_2_1_182_2","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/72.1.191"},{"key":"e_1_2_1_183_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582166"},{"key":"e_1_2_1_184_2","first-page":"237","article-title":"The Steiner tree problem on graph and its heuristic algorithm (in Chinese)","volume":"8","author":"Ma S.","year":"1985","journal-title":"Chin. J. Comput."},{"key":"e_1_2_1_185_2","unstructured":"G. P.McKeown V. J.Rayward\u2010Smith andH. J.Turpin Branch\u2010and\u2010bound as a higher\u2010order function. Preprint (1989)."},{"key":"e_1_2_1_186_2","unstructured":"N.Maculan O problema de Steiner em grafos orientados.II Congresso Latino\u2010americano de Pesquina Operacional e Engenharia de Sistemas Buenos Aires (1984)206\u2013213."},{"key":"e_1_2_1_187_2","first-page":"185","article-title":"The Steiner problem in graphs","volume":"31","author":"Maculan N.","year":"1987","journal-title":"Ann. Discrete Math."},{"key":"e_1_2_1_188_2","unstructured":"N.MaculanandA.Candia\u2010Vejar An approach for the Steiner problem in directed graphs. Preprint (1989)."},{"key":"e_1_2_1_189_2","unstructured":"R. R. L.Matos Rectilinear arborescence and rectilinear Steiner tree problems. PhD Dissertation University of Birmingham (1980)."},{"key":"e_1_2_1_190_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230080104"},{"key":"e_1_2_1_191_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90066-X"},{"key":"e_1_2_1_192_2","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-1961-016-2"},{"key":"e_1_2_1_193_2","volume-title":"Companion to Concrete Mathematics","author":"Melzak Z. A.","year":"1973"},{"key":"e_1_2_1_194_2","doi-asserted-by":"crossref","unstructured":"Z. A.MelzakandJ. S.Forsyth Polyconics 1: Polyellipses and optimization.Q. J. Math. (1977)239\u2013255.","DOI":"10.1090\/qam\/448883"},{"key":"e_1_2_1_195_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.6.2.232"},{"key":"e_1_2_1_196_2","first-page":"221","article-title":"Efficient approximate solution of Steiner tree problems using reoptimization, supermodularity, and the accelerated greedy algorithm","volume":"28","author":"Minoux M.","year":"1990","journal-title":"INFOR"},{"key":"e_1_2_1_197_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-5193(73)90252-X"},{"key":"e_1_2_1_198_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(84)90067-4"},{"key":"e_1_2_1_199_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01949715"},{"key":"e_1_2_1_200_2","doi-asserted-by":"crossref","unstructured":"A. P.\u2010C.Ng P.Raghavan andC. D.Thompson A language for describing rectilinear Steiner tree configurations.23rd ACM\/IEEE Design Automation Conference(1986)659\u2013662.","DOI":"10.1109\/DAC.1986.1586159"},{"key":"e_1_2_1_201_2","first-page":"208","article-title":"Minimum networks linking four points in a plane","volume":"15","author":"Ollerenshaw K.","year":"1978","journal-title":"Inst. Math. Appl."},{"key":"e_1_2_1_202_2","doi-asserted-by":"publisher","DOI":"10.1147\/rd.54.0335"},{"key":"e_1_2_1_203_2","unstructured":"O. I.Palma\u2010Pacheco Contribuicao para a Resolucao do Problema de Steiner num Grafo Direcionado: un Metodo Heuristico. PhD Dissertation Systems Engineering Computer Science COPPE Federal University of Rio de Janeiro (1985)."},{"key":"e_1_2_1_204_2","first-page":"183","article-title":"TurboTree: A fast algorithm for minimal trees","volume":"3","author":"Penny D.","year":"1987","journal-title":"CABIOS"},{"key":"e_1_2_1_205_2","first-page":"155","article-title":"A bound for the Steiner tree problem in graphs","volume":"31","author":"Plesnik J.","year":"1981","journal-title":"Math. Slovaca"},{"key":"e_1_2_1_206_2","unstructured":"J.Plesnik On heuristics for the Steiner problem in graphs. Preprint (1989)."},{"key":"e_1_2_1_207_2","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90058-4"},{"key":"e_1_2_1_208_2","volume-title":"Induction and Analogy in Mathematics","author":"Polya G.","year":"1954"},{"key":"e_1_2_1_209_2","unstructured":"A.Prodon T. M.Liebling andH.Groflin Steiner's problem on two\u2010trees. Technical Report RO850315 Ecole Polytechnique Federale de Lausanne (1985)."},{"key":"e_1_2_1_210_2","unstructured":"J. S.Provan A polynomial algorithm for the Steiner tree problem on terminal\u2010planar graphs. Technical Report UNC\/ORSA\/Tech. Rep.\u201083\/10 Dept. Operations Research University of North Carolina Chapel Hill (1983)."},{"key":"e_1_2_1_211_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230180108"},{"key":"e_1_2_1_212_2","doi-asserted-by":"publisher","DOI":"10.1137\/0217057"},{"key":"e_1_2_1_213_2","article-title":"The role of Steiner hulls in the solution to Steiner tree problems","author":"Provan J. S.","journal-title":"Ann. Oper. Res."},{"key":"e_1_2_1_214_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.32.3.516"},{"key":"e_1_2_1_215_2","unstructured":"W. R.PulleybankandA. E.Steger A min\u2010max equation for Steiner trees on rectangular grids. Preprint (1989)."},{"key":"e_1_2_1_216_2","article-title":"The rectilinear Steiner arborescence problem","author":"Rao S. K.","journal-title":"Algorithmica"},{"key":"e_1_2_1_217_2","unstructured":"R. L.Rardin R. G.Parker andM. B.Richey A polynomial algorithm for a class of Steiner tree problems on graphs. Indus. and Syst. Engr. Rep. Series J\u201082\u20105 Georgia Institute of Technology (1982)."},{"key":"e_1_2_1_218_2","doi-asserted-by":"publisher","DOI":"10.1080\/0020739830140103"},{"key":"e_1_2_1_219_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230160305"},{"key":"e_1_2_1_220_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01553886"},{"key":"e_1_2_1_221_2","article-title":"A simple proof of Hwang's theorem for rectilinear Steiner minimal trees","author":"Richards D.","journal-title":"Ann. Oper. Res."},{"key":"e_1_2_1_222_2","article-title":"A linear\u2010time algorithm to construct a rectilinear Steiner minimal tree for k\u2010extremal point sets","author":"Richards D.","journal-title":"Algorithmica"},{"key":"e_1_2_1_223_2","doi-asserted-by":"publisher","DOI":"10.2307\/2413131"},{"key":"e_1_2_1_224_2","doi-asserted-by":"publisher","DOI":"10.2307\/2413081"},{"key":"e_1_2_1_225_2","article-title":"The calculus of variations and the Steiner problem","author":"Rubenstein J. H.","journal-title":"Ann. Oper. Res."},{"key":"e_1_2_1_226_2","unstructured":"J. H.RubensteinandD. A.Thomas A variational approach to the Steiner ratio conjecture for six points.J. Combinatorial Theory Ser. A."},{"key":"e_1_2_1_227_2","unstructured":"J. H.RubensteinandD. A.Thomas Critical points for the Steiner ratio conjecture. Preprint (1989)."},{"key":"e_1_2_1_228_2","first-page":"353","article-title":"Hypothesis on the length of minimal Steiner tree in multidimensional spaces with a rectilinear metric (in Polish)","volume":"29","author":"Rudowski M. H.","year":"1984","journal-title":"Arch. Autom. Telemech."},{"key":"e_1_2_1_229_2","unstructured":"T. M.Sandifer Algorithms for solving the directed minimal Steiner tree problem. PhD Dissertation University of Massachusetts Amherst (1981)."},{"key":"e_1_2_1_230_2","doi-asserted-by":"publisher","DOI":"10.1137\/0128004"},{"key":"e_1_2_1_231_2","first-page":"253","volume-title":"Time Warps, String Edits and Macromolecules: The Theory and Practice of Sequence Comparison","author":"Sankoff D.","year":"1983"},{"key":"e_1_2_1_232_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01732471"},{"key":"e_1_2_1_233_2","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/10.1.421"},{"key":"e_1_2_1_234_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01681346"},{"key":"e_1_2_1_235_2","unstructured":"M.SarrafzadehandC. K.Wong Geometric Steiner min\u2010max trees. Preprint (1989)."},{"key":"e_1_2_1_236_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230170102"},{"key":"e_1_2_1_237_2","first-page":"21","article-title":"Heuristic algorithms for rectilinear Steiner trees","volume":"7","author":"Servit M.","year":"1981","journal-title":"Digital Processes"},{"key":"e_1_2_1_238_2","doi-asserted-by":"crossref","unstructured":"M. I.ShamosandD.Hoey Closest\u2010point problems.16th Annual Symp. on Foundations of Computer Science(1975)151\u2013162.","DOI":"10.1109\/SFCS.1975.8"},{"key":"e_1_2_1_239_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230120309"},{"key":"e_1_2_1_240_2","unstructured":"J. M.Smith Generalized Steiner network problems. PhD Dissertation University of Illinois Urbana (1978)."},{"key":"e_1_2_1_241_2","unstructured":"J. M.Smith Steiner minimal trees with obstacles. Technical Report Dept. Indust. Engr. and Oper. Res. University of Massachusetts (1982)."},{"key":"e_1_2_1_242_2","first-page":"119","volume-title":"Engineering Design","author":"Smith J. M.","year":"1985"},{"key":"e_1_2_1_243_2","doi-asserted-by":"publisher","DOI":"10.1016\/0038-0121(82)90017-9"},{"key":"e_1_2_1_244_2","doi-asserted-by":"publisher","DOI":"10.1080\/03052158008902421"},{"key":"e_1_2_1_245_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230110104"},{"key":"e_1_2_1_246_2","doi-asserted-by":"publisher","DOI":"10.1080\/03052157908902401"},{"key":"e_1_2_1_247_2","doi-asserted-by":"publisher","DOI":"10.1016\/0307-904X(80)90163-8"},{"key":"e_1_2_1_248_2","article-title":"Steiner minimal trees for three points and one convex polygonal obstacle","author":"Smith J. M.","journal-title":"Ann. Oper. Res."},{"key":"e_1_2_1_249_2","unstructured":"W. D.Smith Studies in computational geometry motivated by mesh generation. PhD dissertation Princeton University (1988)."},{"key":"e_1_2_1_250_2","article-title":"How to find Steiner minimal trees in Euclidean d\u2010Space","author":"Smith W. D.","journal-title":"Algorithmica"},{"key":"e_1_2_1_251_2","doi-asserted-by":"crossref","unstructured":"T.Snyder On minimal rectilinear Steiner trees in all dimensions.Proc. 6th ACM Symp. Comput. Geom.(1990)311\u2013320.","DOI":"10.1145\/98524.98596"},{"key":"e_1_2_1_252_2","doi-asserted-by":"publisher","DOI":"10.1137\/0129048"},{"key":"e_1_2_1_253_2","first-page":"37","article-title":"Minimum Steiner trees, roots of a polynomial and other magic","volume":"22","author":"Soukup J.","year":"1977","journal-title":"ACM\/SIGMAP Newsletter"},{"key":"e_1_2_1_254_2","first-page":"48","article-title":"Set of test problems of the minimum length connection networks","volume":"15","author":"Soukup J.","year":"1973","journal-title":"SIGMAP Newsletter"},{"key":"e_1_2_1_255_2","unstructured":"R.Spira Am. math. mon. problem. Preprint."},{"key":"e_1_2_1_256_2","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176994411"},{"key":"e_1_2_1_257_2","volume-title":"Mathematical Snapshots","author":"Steinhaus H.","year":"1960"},{"key":"e_1_2_1_258_2","unstructured":"G. F.Sullivan Approximation algorithms for Steiner tree problems. Technical Report 249 Dept. Computer Science Yale University (1982)."},{"key":"e_1_2_1_259_2","doi-asserted-by":"crossref","unstructured":"J. W.Suurballe Algorithms for minimal trees and semi\u2010Steiner trees based on the simplex method(Abstract).Proc. Princeton Symp on Math Program.(1970)614\u2013615.","DOI":"10.1515\/9781400869930-072"},{"key":"e_1_2_1_260_2","first-page":"106","article-title":"A heuristic method for Euclidean Steiner problem as a geographical optimization problem","volume":"3","author":"Suzuki A.","year":"1986","journal-title":"Asia\u2010Pacific J. Operations Res."},{"key":"e_1_2_1_261_2","first-page":"573","article-title":"An approximate solution for the Steiner problem in graphs","volume":"24","author":"Takahashi H.","year":"1980","journal-title":"Math. Jpn."},{"key":"e_1_2_1_262_2","doi-asserted-by":"publisher","DOI":"10.1145\/322326.322328"},{"key":"e_1_2_1_263_2","unstructured":"O.TaraszowandA.Iwainsky Trassierung und Plazierung auf Graphenmodellen.Vortrags\u2010Sammelband der 4. Fachtagung Numerische Realisierung Math. Modelle(1981)215\u2013231."},{"key":"e_1_2_1_264_2","unstructured":"O.TaraszowandP.Richter New heuristic algorithms for solving the Steiner tree problem in graphs. To appear."},{"key":"e_1_2_1_265_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-18099-0_44"},{"key":"e_1_2_1_266_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1469-1809.1973.tb00595.x"},{"key":"e_1_2_1_267_2","doi-asserted-by":"publisher","DOI":"10.1147\/rd.62.0259"},{"key":"e_1_2_1_268_2","doi-asserted-by":"publisher","DOI":"10.1137\/0145051"},{"key":"e_1_2_1_269_2","doi-asserted-by":"publisher","DOI":"10.1137\/0150015"},{"key":"e_1_2_1_270_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230150307"},{"key":"e_1_2_1_271_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01078826"},{"key":"e_1_2_1_272_2","first-page":"79","article-title":"Some experiments with Steiner trees","volume":"36","author":"van de Heyden P. A.","year":"1977","journal-title":"Int. Ser. Numer. Math."},{"key":"e_1_2_1_273_2","unstructured":"L. P. P. P.van GinnekenandR. H. J. M.Otten Global wiring for custom layout design.Proc. Intl. Symp. Circuits and Systems(1985)207\u2013208."},{"key":"e_1_2_1_274_2","unstructured":"S.Voss Degree\u2010constrained Steiner problem.Proc. EuroVIII(1986)."},{"key":"e_1_2_1_275_2","unstructured":"S.Voss A survey of some generalizations of Steiner's problem in graphs.Proc. First Balkan Conf. Operations Res.(1988)."},{"key":"e_1_2_1_276_2","unstructured":"S.Voss Steiner's problem in directed graphs: Logical tests in a branch and bound algorithm. Preprint (1989)."},{"key":"e_1_2_1_277_2","first-page":"239","article-title":"A reduction\u2010based algorithm for the Steiner problem in graphs","volume":"58","author":"Voss S.","year":"1989","journal-title":"Methods Operations Res."},{"key":"e_1_2_1_278_2","first-page":"161","article-title":"On a generalized Steiner problem with 2\u2010edge\u2010connectivity","volume":"57","author":"Voss S.","year":"1987","journal-title":"Methods Operations Res."},{"key":"e_1_2_1_279_2","unstructured":"J. A.Wald A linear algorithm for a class of problems on partial 2\u2010trees. Manuscript Schlumberger Tech. Corp. (1987)."},{"key":"e_1_2_1_280_2","unstructured":"J. A.WaldandC. J.Colbourn Steiner trees in outerplanar graphs.Proc. 13th S.E. Conf. Combinatorics Graph Theory and Computing(1982)15\u201322."},{"key":"e_1_2_1_281_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230130202"},{"key":"e_1_2_1_282_2","doi-asserted-by":"publisher","DOI":"10.1016\/0026-2714(83)91008-9"},{"key":"e_1_2_1_283_2","doi-asserted-by":"publisher","DOI":"10.1145\/1270.1275"},{"key":"e_1_2_1_284_2","unstructured":"S.\u2010M.Wang A multiple source algorithm for suboptimum Steiner trees in graphs.Proc WG'85(1985)387\u2013396."},{"key":"e_1_2_1_285_2","doi-asserted-by":"crossref","unstructured":"T.WatanabeandY.Sugiyama A new routing algorithm and its hardware implementation.Proc. 23rd ACM\/IEEE Design Automation Conf.(1986)574\u2013580.","DOI":"10.1109\/DAC.1986.1586145"},{"key":"e_1_2_1_286_2","doi-asserted-by":"publisher","DOI":"10.1109\/49.12889"},{"key":"e_1_2_1_287_2","unstructured":"B. M.Waxman Probable performance of Steiner tree algorithms. Technical report WUCS\u201088\u20104 Dept. Computer Science Washington University St. Louis (1988)."},{"key":"e_1_2_1_288_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90225-6"},{"key":"e_1_2_1_289_2","first-page":"129","article-title":"Steiner minimal trees on vertices of regular polygons","volume":"8","author":"Weng J. F.","year":"1983","journal-title":"Acta Math. Appl. Sinica"},{"key":"e_1_2_1_290_2","first-page":"383","article-title":"Generalized Steiner problems and hexagonal coordinate system (in Chinese)","volume":"8","author":"Weng J. F.","year":"1985","journal-title":"Acta Math. Appl. Sinica"},{"key":"e_1_2_1_291_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1541-0064.1969.tb00493.x"},{"key":"e_1_2_1_292_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230150109"},{"key":"e_1_2_1_293_2","unstructured":"P.Widmayer Fast approximation algorithms for Steiner's problem in graphs. Technical report Inst. fur Angew. Info. University of Karlsruhe (1985)."},{"key":"e_1_2_1_294_2","first-page":"17","volume-title":"Graph\u2010Theoretic Concepts in Computer Science","author":"Widmayer P.","year":"1986"},{"key":"e_1_2_1_295_2","unstructured":"P.Winter The Steiner problem. M.Sc. Thesis Inst. of Datalogy University of Copenhagen Denmark (1981)."},{"key":"e_1_2_1_296_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230150305"},{"key":"e_1_2_1_297_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01935369"},{"key":"e_1_2_1_298_2","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90018-0"},{"key":"e_1_2_1_299_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230170203"},{"key":"e_1_2_1_300_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(87)90031-X"},{"key":"e_1_2_1_301_2","unstructured":"P.Winter Generalized Steiner problem in Halin networks. To appear."},{"key":"e_1_2_1_302_2","unstructured":"P.Winter Construction of minimum distance rectangle trees. To appear."},{"key":"e_1_2_1_303_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02612335"},{"key":"e_1_2_1_304_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289500"},{"key":"e_1_2_1_305_2","doi-asserted-by":"crossref","unstructured":"J. G.Xiong Algorithms for global routing.23rd ACM\/IEEE Design Automation Conference(1986)824\u2013830.","DOI":"10.1109\/DAC.1986.1586184"},{"key":"e_1_2_1_306_2","unstructured":"Y. Y.YangandO.Wing An algorithm for the wiring problem.Digest IEEE Int. Symp. Electrical Networks(1971)14\u201315."},{"key":"e_1_2_1_307_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCT.1972.1083538"},{"key":"e_1_2_1_308_2","unstructured":"Y. Y.YangandO.Wing Optimal and suboptimal solution algorithms for the wiring problem.Proc. IEEE Int. Symp. Circuit Theory(1972)154\u2013158."},{"key":"e_1_2_1_309_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCT.1973.1083680"},{"key":"e_1_2_1_310_2","unstructured":"W. C.YuandS. B.Xu The Steiner ratio conjecture for six points.Tienjing Conf. Combinatorial Optimization(1988)."},{"key":"e_1_2_1_311_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01952728"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230220105","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230220105","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T05:56:58Z","timestamp":1737007018000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230220105"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":310,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["10.1002\/net.3230220105"],"URL":"https:\/\/doi.org\/10.1002\/net.3230220105","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,1]]}}}