{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T06:04:07Z","timestamp":1764655447594},"reference-count":5,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"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,4]]},"DOI":"10.1016\/s0020-0190(98)00034-9","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"81-85","source":"Crossref","is-referenced-by-count":85,"title":["On the minimum label spanning tree problem"],"prefix":"10.1016","volume":"66","author":[{"given":"Sven O.","family":"Krumke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans-Christoph","family":"Wirth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00034-9_BIB1","series-title":"Proc. 29th Annual ACM Symposium on the Theory of Computing (STOC'97)","first-page":"485","article-title":"Improved low-degree testing and its applications","author":"Arora","year":"1997"},{"key":"10.1016\/S0020-0190(98)00034-9_BIB2","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0020-0190(97)00127-0","article-title":"The minimum labeling spanning trees","volume":"63","author":"Chang","year":"1997","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(98)00034-9_BIB3","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0020-0190(98)00034-9_BIB4","article-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0020-0190(98)00034-9_BIB5","series-title":"Approximation Algorithms for NP-Hard Problems","year":"1997"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000349?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000349?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T18:53:56Z","timestamp":1555959236000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098000349"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["S0020019098000349"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00034-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}