{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:43:22Z","timestamp":1773272602713,"version":"3.50.1"},"reference-count":9,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"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":[[1994,10]]},"DOI":"10.1016\/0020-0190(94)90139-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"45-49","source":"Crossref","is-referenced-by-count":66,"title":["A short note on the approximability of the maximum leaves spanning tree problem"],"prefix":"10.1016","volume":"52","author":[{"given":"G.","family":"Galbiati","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Maffioli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Morzenti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)90139-2_BIB1","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/SFCS.1992.267823","article-title":"Proof verification and hardness of approximation problems","author":"Arora","year":"1992","journal-title":"Proc. 33rd Ann. IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(94)90139-2_BIB2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/SFCS.1992.267824","article-title":"Probabilistic checking of proofs: A new characterization of NP","author":"Arora","year":"1992","journal-title":"Proc. 33rd Ann. IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(94)90139-2_BIB3","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0890-5401(91)90025-W","article-title":"Completeness in approximation classes","volume":"93","author":"Crescenzi","year":"1991","journal-title":"Inform. and Comput."},{"key":"10.1016\/0020-0190(94)90139-2_BIB4","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/361179.361202","article-title":"Self-stabilizing systems in spite of distributed control","volume":"17","author":"Dijkstra","year":"1974","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(94)90139-2_BIB5","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(94)90139-2_BIB6","first-page":"533","article-title":"The power of local optimization: Approximation algorithms for Maximum-Leaf Spanning Tree","author":"Lu","year":"1992","journal-title":"Proc. Allerton Conf."},{"key":"10.1016\/0020-0190(94)90139-2_BIB7","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","article-title":"Approximation algorithms for combinatorial problems","volume":"9","author":"Johnson","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(94)90139-2_BIB8","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."},{"key":"10.1016\/0020-0190(94)90139-2_BIB9","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1051\/ita\/1981150100471","article-title":"Sur l'auto-stabilisation dans un r\u00e9seau d'odinateurs","volume":"15","author":"Tchuente","year":"1981","journal-title":"RAIRO Inform. Th\u00e9or."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094901392?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094901392?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:52:00Z","timestamp":1555145520000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094901392"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["0020019094901392"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)90139-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}