{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T19:27:25Z","timestamp":1760729245276},"reference-count":3,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"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":[[1998,2]]},"DOI":"10.1016\/s0020-0190(98)00010-6","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"117-118","source":"Crossref","is-referenced-by-count":27,"title":["A 2.5-factor approximation algorithm for the k-MST problem"],"prefix":"10.1016","volume":"65","author":[{"given":"Sunil","family":"Arya","sequence":"first","affiliation":[]},{"given":"H.","family":"Ramesh","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00010-6_BIB1","series-title":"Proc. ACM Symp. on the Theory of Computing","first-page":"294","article-title":"A constant factor approximation algorithm for the k-MST problem","author":"Blum","year":"1995"},{"key":"10.1016\/S0020-0190(98)00010-6_BIB2","series-title":"Proc. IEEE Foundations of Computer Science","first-page":"302","article-title":"A 3 factor approximation algorithm for the minimum tree spanning k vertices","author":"Garg","year":"1996"},{"key":"10.1016\/S0020-0190(98)00010-6_BIB3","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1137\/S0097539793242618","article-title":"A general approximation technique for constrained forest problems","volume":"24","author":"Goemans","year":"1995","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000106?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000106?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:27:17Z","timestamp":1556058437000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098000106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":3,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["S0020019098000106"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00010-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,2]]}}}