{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:56:41Z","timestamp":1760245001790,"version":"build-2065373602"},"reference-count":10,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3669,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Mathematics Letters"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1016\/s0893-9659(03)00075-2","type":"journal-article","created":{"date-parts":[[2003,9,11]],"date-time":"2003-09-11T17:05:40Z","timestamp":1063299940000},"page":"733-739","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["Differential approximation results for the Steiner tree problem"],"prefix":"10.1016","volume":"16","author":[{"given":"M","family":"Demange","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J","family":"Monnot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.Th","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0893-9659(03)00075-2_BIB1","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0020-0190(89)90039-2","article-title":"The Steiner problem with edge lengths 1 and 2","volume":"32","author":"Bern","year":"1989","journal-title":"Inform. Process. Lett."},{"year":"1979","series-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"Garey","key":"10.1016\/S0893-9659(03)00075-2_BIB2"},{"key":"10.1016\/S0893-9659(03)00075-2_BIB3","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF01187035","article-title":"An 116-approximation algorithm for the network Steiner problem","volume":"9","author":"Zelikovsky","year":"1993","journal-title":"Algorithmica"},{"key":"10.1016\/S0893-9659(03)00075-2_BIB4","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1006\/jagm.1994.1041","article-title":"Improved approximation for the Steiner tree problem","volume":"17","author":"Berman","year":"1994","journal-title":"J. Algorithms"},{"key":"10.1016\/S0893-9659(03)00075-2_BIB5","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1023\/A:1009758919736","article-title":"New approximation algorithms for the Steiner tree problems","volume":"1","author":"Karpinski","year":"1997","journal-title":"J. Comb. Opti."},{"key":"10.1016\/S0893-9659(03)00075-2_BIB6","series-title":"Proc. Symposium on Discrete Algorithms","first-page":"770","article-title":"Improved Steiner tree approximation in graphs","author":"Robins","year":"2000"},{"key":"10.1016\/S0893-9659(03)00075-2_BIB7","first-page":"678","article-title":"On the approximability of the Steiner tree problem","volume":"Volume 2136","author":"Thimm","year":"2001"},{"key":"10.1016\/S0893-9659(03)00075-2_BIB8","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0304-3975(95)00060-7","article-title":"On an approximation measure founded on the links between optimization and polynomial approximation theory","volume":"158","author":"Demange","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0893-9659(03)00075-2_BIB9","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02392825","article-title":"Clique is hard to approximate within nl\u2212\u03f5","volume":"182","author":"H\u00e5stad","year":"1999","journal-title":"Acta Mathematica"},{"key":"10.1016\/S0893-9659(03)00075-2_BIB10","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","article-title":"Optimization, approximation and complexity classes","volume":"43","author":"Papadimitriou","year":"1991","journal-title":"J. Comput. System Sci."}],"container-title":["Applied Mathematics Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893965903000752?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893965903000752?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:07:58Z","timestamp":1760238478000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0893965903000752"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":10,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0893965903000752"],"URL":"https:\/\/doi.org\/10.1016\/s0893-9659(03)00075-2","relation":{},"ISSN":["0893-9659"],"issn-type":[{"type":"print","value":"0893-9659"}],"subject":[],"published":{"date-parts":[[2003,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Differential approximation results for the Steiner tree problem","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0893-9659(03)00075-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}]}}