{"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":1760245001499,"version":"build-2065373602"},"reference-count":8,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"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":4307,"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":[[2001,10]]},"DOI":"10.1016\/s0893-9659(01)00047-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:58:29Z","timestamp":1027601909000},"page":"801-804","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["Leafy spanning trees in hypercubes"],"prefix":"10.1016","volume":"14","author":[{"given":"W.","family":"Duckworth","sequence":"first","affiliation":[]},{"given":"P.E.","family":"Dunne","sequence":"additional","affiliation":[]},{"given":"A.M.","family":"Gibbons","sequence":"additional","affiliation":[]},{"given":"M.","family":"Zito","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1979","author":"Garey","key":"10.1016\/S0893-9659(01)00047-7_BIB1"},{"key":"10.1016\/S0893-9659(01)00047-7_BIB2","first-page":"533","article-title":"The power of local optimization: Approximation algorithms for maximum leaf spanning tree","author":"Lu","year":"1992","journal-title":"Proceedings of the Thirtieth Annual Allerton Conference on Communication, Control and Computing"},{"key":"10.1016\/S0893-9659(01)00047-7_BIB3","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1006\/jagm.1998.0944","article-title":"Approximating maximum-leaf spanning trees in almost linear time","volume":"29","author":"Lu","year":"1998","journal-title":"Journal of Algorithms"},{"key":"10.1016\/S0893-9659(01)00047-7_BIB4","first-page":"441","article-title":"2-approximation algorithm for finding a spanning tree with maximum number of leaves","author":"Solis-Oba","year":"1998","journal-title":"Proceedings of the 6th Annual European Symposium on Algorithms"},{"key":"10.1016\/S0893-9659(01)00047-7_BIB5","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0020-0190(94)90139-2","article-title":"A short note on the approximability of the maximum leaves spanning tree problem","volume":"52","author":"Galbiati","year":"1994","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0893-9659(01)00047-7_BIB6","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1137\/0404010","article-title":"Spanning trees with many leaves","volume":"4","author":"Kleitman","year":"1991","journal-title":"SIAM Journal on Discrete Mathematics"},{"journal-title":"Algebraic Coding Theory","year":"1984","author":"Berlekamp","key":"10.1016\/S0893-9659(01)00047-7_BIB7"},{"issue":"3","key":"10.1016\/S0893-9659(01)00047-7_BIB8","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0893-9659(93)90027-K","article-title":"Independent domination in hypercubes","volume":"6","author":"Harary","year":"1993","journal-title":"Appl. Math. Lett."}],"container-title":["Applied Mathematics Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893965901000477?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893965901000477?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:01:19Z","timestamp":1760238079000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0893965901000477"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":8,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0893965901000477"],"URL":"https:\/\/doi.org\/10.1016\/s0893-9659(01)00047-7","relation":{},"ISSN":["0893-9659"],"issn-type":[{"type":"print","value":"0893-9659"}],"subject":[],"published":{"date-parts":[[2001,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Leafy spanning trees in hypercubes","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0893-9659(01)00047-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2001 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}]}}