{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T22:05:03Z","timestamp":1765231503772},"reference-count":5,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"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":[[2003,6]]},"DOI":"10.1016\/s0020-0190(03)00210-2","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:55:41Z","timestamp":1052769341000},"page":"335-338","source":"Crossref","is-referenced-by-count":7,"title":["On Rajagopalan and Vazirani's -approximation bound for the Iterated 1-Steiner heuristic"],"prefix":"10.1016","volume":"86","author":[{"given":"Romeo","family":"Rizzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"7","key":"10.1016\/S0020-0190(03)00210-2_BIB001","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1109\/43.144853","article-title":"A new class of iterative Steiner tree heuristics with good performance","volume":"11","author":"Kahng","year":"1992","journal-title":"IEEE Trans. Computer-Aided Design"},{"key":"10.1016\/S0020-0190(03)00210-2_BIB002","series-title":"On Optimal Interconnections for VLSI","author":"Kahng","year":"1995"},{"key":"10.1016\/S0020-0190(03)00210-2_BIB003","series-title":"SODA'99","first-page":"742","article-title":"On the bidirected cut relaxation for the metric Steiner tree problem","author":"Rajagopalan","year":"1999"},{"key":"10.1016\/S0020-0190(03)00210-2_BIB004","series-title":"SODA'00","article-title":"Improved Steiner tree approximation in graphs","author":"Robins","year":"2000"},{"key":"10.1016\/S0020-0190(03)00210-2_BIB005","doi-asserted-by":"crossref","unstructured":"R. Rizzi, On the Steiner tree 32-approximation for quasi-bipartite graphs, BRICS Report Series, RS-99-39, November 1999","DOI":"10.7146\/brics.v6i39.20108"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019003002102?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019003002102?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T23:57:05Z","timestamp":1553212625000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019003002102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":5,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0020019003002102"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(03)00210-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}