{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T18:00:51Z","timestamp":1778608851012,"version":"3.51.4"},"reference-count":10,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,5,1]],"date-time":"1993-05-01T00:00:00Z","timestamp":736214400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1993,5]]},"DOI":"10.1016\/0020-0190(93)90201-j","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"79-83","source":"Crossref","is-referenced-by-count":41,"title":["A faster approximation algorithm for the steiner tree problem in graphs"],"prefix":"10.1016","volume":"46","author":[{"given":"Alexander Z.","family":"Zelikovsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90201-J_BIB1","series-title":"Tech. Rept. #CS-91-05","article-title":"An approximation algorithm for the Steiner tree problem","author":"Berman","year":"1991"},{"key":"10.1016\/0020-0190(93)90201-J_BIB2","first-page":"325","article-title":"Improved approximations for the Steiner tree problem","author":"Berman","year":"1992","journal-title":"Proc. 3rd SODA"},{"key":"10.1016\/0020-0190(93)90201-J_BIB3","first-page":"431","article-title":"On better heuristic for Euclidean Steiner minimum trees","author":"Du","year":"1992","journal-title":"Proc. 32nd Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(93)90201-J_BIB4","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","article-title":"Fibonacci heaps their uses in improved network optimization algorithms","volume":"34","author":"Fredman","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(93)90201-J_BIB5","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","article-title":"Fast algorithms for finding nearest common ancestor","volume":"13","author":"Harel","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(93)90201-J_BIB6","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0020-0190(93)90201-J_BIB7","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0020-0190(88)90066-X","article-title":"A faster approximation algorithm for the Steiner problem in graphs","volume":"27","author":"Mehlhorn","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(93)90201-J_BIB8","first-page":"573","article-title":"An approximate solution for the Steiner problem in graphs","author":"Takahashi","year":"1980","journal-title":"Math. Japon."},{"key":"10.1016\/0020-0190(93)90201-J_BIB9","first-page":"44","article-title":"The Steiner problem in graphs without optimal vertices","volume":"121","author":"Zelikovsky","year":"1991","journal-title":"Mat. Issled."},{"key":"10.1016\/0020-0190(93)90201-J_BIB10","series-title":"Proc. Fourth Czechoslovakian Symp. on Combinatorics, Graphs and Complexity","first-page":"351","article-title":"An 11\/6-approximation algorithm for the Steiner problem on graphs","volume":"51","author":"Zelikovsky","year":"1992"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390201J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390201J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:27:08Z","timestamp":1555144028000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390201J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,5]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,5]]}},"alternative-id":["002001909390201J"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90201-j","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,5]]}}}