{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T12:07:26Z","timestamp":1765368446073},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1986,5,1]],"date-time":"1986-05-01T00:00:00Z","timestamp":515289600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1986,5]]},"DOI":"10.1007\/bf00289500","type":"journal-article","created":{"date-parts":[[2004,10,5]],"date-time":"2004-10-05T03:55:13Z","timestamp":1096948513000},"page":"223-229","source":"Crossref","is-referenced-by-count":71,"title":["A faster approximation algorithm for the Steiner problem in graphs"],"prefix":"10.1007","volume":"23","author":[{"given":"Y. F.","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Widmayer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. K.","family":"Wong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Reading: Addison-Wesley 1974"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/net.3230100207","volume":"10","author":"Y.P. Aneja","year":"1980","unstructured":"Aneja, Y.P.: An Integer Linear Programming Approach to the Steiner Problem in Graphs. Networks 10, 167 (1980)","journal-title":"Networks"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1002\/net.3230140112","volume":"14","author":"J.E. Beasley","year":"1984","unstructured":"Beasley, J.E.: An Algorithm for the Steiner Problem in Graphs. Networks, 14, 148 (1984)","journal-title":"Networks"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connection with graphs. Numer. Math. 1, 269?271 (1959)","journal-title":"Numer. Math."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1016\/0097-3165(82)90056-5","volume":"32","author":"D.Z. Du","year":"1982","unstructured":"Du, D.Z., Yao, E.Y., Hwang, F.K.: A short proof of a result of Pollak on Steiner minimal trees. J. Comb. Theory, Ser. A, 32, 396 (1982)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Garey, M.R., Graham, R.L., Johnson, D.S.: Some NP-complete Geometric Problems. 8th Annual ACM Symposium on Theory of Computing, pp. 10?22, 1976","DOI":"10.1145\/800113.803626"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0116001","volume":"16","author":"E.N. Gilbert","year":"1968","unstructured":"Gilbert, E.N., Pollak, H.U.: Steiner Minimal Trees. SIAM J. Appl. Math. 16, 1 (1968)","journal-title":"SIAM J. Appl. Math."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among Combinatorial Problems. In: Complexity of Computer Computations, pp. 85?103. New York: Plenum Press 1972"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00288961","volume":"15","author":"L. Kou","year":"1981","unstructured":"Kou, L., Markowsky, G., Berman, L.: A Fast Algorithm for Steiner Trees. Acta Inf. 15, 141?145 (1981)","journal-title":"Acta Inf."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J.B. Kruskal Jr.","year":"1956","unstructured":"Kruskal, J.B., Jr.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc. 7, 48?50 (1956)","journal-title":"Proc. Am. Math. Soc."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0097-3165(78)90058-4","volume":"24","author":"H.U. Pollak","year":"1982","unstructured":"Pollak, H.U.: Some remarks on the Steiner Problem. J. Comb. Theory, Ser. A, 24, 278 (1982)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"CR12","first-page":"573","volume":"24","author":"H. Takahashi","year":"1980","unstructured":"Takahashi, H., Matsuyama, A.: An Approximate Solution for the Steiner Problem in Graphs. Math. Jap. 24, 573?577 (1980)","journal-title":"Math. Jap."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289500.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00289500\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289500","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T21:14:54Z","timestamp":1554758094000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00289500"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,5]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,5]]}},"alternative-id":["BF00289500"],"URL":"https:\/\/doi.org\/10.1007\/bf00289500","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,5]]}}}