{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:46:17Z","timestamp":1725471977388},"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":7345,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1986,9]]},"abstract":"Abstract<\/jats:title>Given a graph G<\/jats:italic> = (V, E<\/jats:italic>), finding the Steiner tree in G<\/jats:italic> for some set of special vertices V<\/jats:italic>\u2032 \u2282 V<\/jats:italic>\u2033, is equivalent to finding the minimum spanning tree in the subgraph of G<\/jats:italic> induced by V<\/jats:italic>\u2032 \u222a V<\/jats:italic>\u2033, where V<\/jats:italic>\u2033 is the set of Steiner vertices. In this paper, we consider ways of deciding which vertices of V<\/jats:italic> are in V<\/jats:italic>\u2033 and compare the performance of various heuristic algorithms.<\/jats:p>","DOI":"10.1002\/net.3230160305","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T21:17:15Z","timestamp":1178918235000},"page":"283-294","source":"Crossref","is-referenced-by-count":114,"title":["On finding steiner vertices"],"prefix":"10.1002","volume":"16","author":[{"given":"V. J.","family":"Rayward\u2010Smith","sequence":"first","affiliation":[]},{"given":"A.","family":"Clare","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.3230140112"},{"key":"e_1_2_1_3_2","volume-title":"Heuristic algorithms for finding Steiner vertices. School of Computing Studies and Accountancy","author":"Clare A.","year":"1984"},{"key":"e_1_2_1_4_2","doi-asserted-by":"crossref","unstructured":"E. W.Dijkstra A note on two problems in connection with graphs. Numerische Mathematik (1959)269\u2013271.","DOI":"10.1007\/BF01386390"},{"key":"e_1_2_1_5_2","doi-asserted-by":"crossref","unstructured":"S. E.DreyfusandR. A.Wagner The Steiner problem in graphs. Networks (1972)195\u2013207.","DOI":"10.1002\/net.3230010302"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368168"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1080\/03052158308960625"},{"key":"e_1_2_1_8_2","article-title":"Some NP\u2010complete geometric problems","volume":"10","author":"Garey M. R.","year":"1976","journal-title":"Proc. of the 8th Annual ACM Symposium on Theory of Computing"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1137\/0132072"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1137\/0132071"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230010203"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288961"},{"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","first-page":"1477","article-title":"Algorithm for the shortest connection of a group of graph vertices","volume":"12","author":"Levin A.","year":"1971","journal-title":"Soviet Math. Dokl."},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1080\/0020739830140103"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230120309"},{"key":"e_1_2_1_19_2","first-page":"573","article-title":"An approximate solution for the Steiner problem in graphs","volume":"6","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.3230160305","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230160305","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T02:17:46Z","timestamp":1697854666000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230160305"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,9]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1986,9]]}},"alternative-id":["10.1002\/net.3230160305"],"URL":"https:\/\/doi.org\/10.1002\/net.3230160305","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,9]]}}}