{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T11:56:56Z","timestamp":1781092616105,"version":"3.54.1"},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1993,5,1]],"date-time":"1993-05-01T00:00:00Z","timestamp":736214400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1993,5]]},"DOI":"10.1007\/bf01187035","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T12:11:10Z","timestamp":1108728670000},"page":"463-470","source":"Crossref","is-referenced-by-count":248,"title":["An 11\/6-approximation algorithm for the network steiner problem"],"prefix":"10.1007","volume":"9","author":[{"given":"A. Z.","family":"Zelikovsky","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computation","author":"R. M. Karp","year":"1972","unstructured":"R. M. Karp, Reducibility among combinatorial problems, in: R. E. Miller and J. W. Tatcher, eds.,Complexity of Computer Computation, Plenum, New York, 1972, pp. 85?103."},{"key":"CR2","first-page":"369","volume":"27","author":"L. Kou","year":"1990","unstructured":"L. Kou, A faster approximation algorithm for the Steiner problem in graphs,Acta Inform.,27 (1990), 369?380.","journal-title":"Acta Inform."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00288961","volume":"15","author":"L. Kou","year":"1981","unstructured":"L. Kou, G. Markowsky, and L. Berman, A fast algorithm for Steiner trees,Acta Inform.,15 (1981), 141?145.","journal-title":"Acta Inform."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0020-0190(88)90066-X","volume":"27","author":"K. Mehlhorn","year":"1988","unstructured":"K. Mehlhorn, A faster approximation algorithm for the Steiner problem in graphs,Inform. Process. Lett.,27 (1988), 125?128.","journal-title":"Inform. Process. Lett."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/net.3230170203","volume":"17","author":"P. Winter","year":"1987","unstructured":"P. Winter, Steiner problem in networks: a survey,Networks,17 (1987), 129?167.","journal-title":"Networks"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01187035.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01187035\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01187035","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T12:35:44Z","timestamp":1556714144000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01187035"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,5]]},"references-count":5,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1993,5]]}},"alternative-id":["BF01187035"],"URL":"https:\/\/doi.org\/10.1007\/bf01187035","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,5]]}}}