{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,4]],"date-time":"2025-10-04T18:20:32Z","timestamp":1759602032373},"reference-count":18,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":8806,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1982,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The Steiner problem in graphs is concerned with finding a set of edges with minimum total weight which connects a given subset of points in a weighted graph. A branch and bound algorithm for solving this problem is presented together with an interesting application to a problem in molecular evolution. Computational experience gained in using the algorithm compares favorably, for certain classes of graphs, with that of existing methods.<\/jats:p>","DOI":"10.1002\/net.3230120309","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T13:50:56Z","timestamp":1178891456000},"page":"323-333","source":"Crossref","is-referenced-by-count":41,"title":["An algorithm for the steiner problem in graphs"],"prefix":"10.1002","volume":"12","author":[{"given":"M. L.","family":"Shore","sequence":"first","affiliation":[]},{"given":"L. R.","family":"Foulds","sequence":"additional","affiliation":[]},{"given":"P. B.","family":"Gibbons","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","first-page":"349","article-title":"On a routing problem","volume":"16","author":"Bellman R. E.","year":"1962","journal-title":"Quart. Appl. Math."},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/321724.321733"},{"key":"e_1_2_1_4_2","first-page":"145","volume-title":"Graph Theory: An Algorithmic Approach","author":"Christofides N.","year":"1975"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1137\/0118014"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230010302"},{"key":"e_1_2_1_8_2","first-page":"87","article-title":"Algorithm 97, shortest path","volume":"16","author":"Floyd R. W.","year":"1958","journal-title":"Comm. A.C.M."},{"key":"e_1_2_1_9_2","volume-title":"Network flow theory","author":"Ford L. R.","year":"1956"},{"key":"e_1_2_1_10_2","unstructured":"L. R.FouldsandP. B.Gibbons A branch and bound approach to the Steiner problem in graphs. Paper presented at 14th Ann. Conf. O.R.S.N.Z. Christ\u2010church New Zealand May1978."},{"key":"e_1_2_1_11_2","first-page":"21","article-title":"Solving a problem concerning molecular evolution using the O.R. approach","volume":"6","author":"Foulds L. R.","year":"1978","journal-title":"N. Z. Operational Research"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230010203"},{"key":"e_1_2_1_13_2","first-page":"273","article-title":"Algorithm 422\u2010minimal spanning tree","volume":"15","author":"Kevin V.","year":"1972","journal-title":"Comm. A.C.M."},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1956-0078686-7"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-1961-016-2"},{"key":"e_1_2_1_16_2","unstructured":"E. F.Moore The shortest path through a maze. Proc. Int. Symp. on the Theory of Switching Part II (1957)285."},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"e_1_2_1_18_2","volume-title":"Combinatorial Programming, Spatial Analysis, and Planning","author":"Scott A.","year":"1971"},{"key":"e_1_2_1_19_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. Japonica"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230120309","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230120309","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T13:19:53Z","timestamp":1699795193000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230120309"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,9]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,9]]}},"alternative-id":["10.1002\/net.3230120309"],"URL":"https:\/\/doi.org\/10.1002\/net.3230120309","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,9]]}}}