{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:19Z","timestamp":1740122359168,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T00:00:00Z","timestamp":1654819200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T00:00:00Z","timestamp":1654819200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["310979\/2020-0","423833\/2018-9"],"award-info":[{"award-number":["310979\/2020-0","423833\/2018-9"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["312026\/2021-8","428385\/2018-4"],"award-info":[{"award-number":["312026\/2021-8","428385\/2018-4"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","award":["001"],"award-info":[{"award-number":["001"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s10878-022-00872-z","type":"journal-article","created":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T17:03:04Z","timestamp":1654880584000},"page":"934-946","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Leafy spanning k-forests"],"prefix":"10.1007","volume":"44","author":[{"given":"Cristina G.","family":"Fernandes","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0602-6298","authenticated-orcid":false,"given":"Carla N.","family":"Lintzmayer","sequence":"additional","affiliation":[]},{"given":"M\u00e1rio C\u00e9sar","family":"San Felice","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"872_CR1","doi-asserted-by":"crossref","unstructured":"Chellali M, Favaron O (2020) Connected domination. In: Haynes TW, Hedetniemi ST, Henning MA (eds) Topics in domination in graphs. Developments in mathematics, vol.\u00a064, pp. 79\u2013127. Springer","DOI":"10.1007\/978-3-030-51117-3_4"},{"key":"872_CR2","first-page":"387","volume":"98","author":"H Chen","year":"2011","unstructured":"Chen H, Chen X, Tan X (2011) On $$k$$-connected restrained domination in graph. Ars Combin 98:387\u2013397","journal-title":"Ars Combin"},{"key":"872_CR3","doi-asserted-by":"publisher","first-page":"1264","DOI":"10.1016\/j.ic.2008.07.003","volume":"206","author":"M Chleb\u00edk","year":"2008","unstructured":"Chleb\u00edk M, Chleb\u00edkov\u00e1 J (2008) Approximation hardness of dominating set problems in bounded degree graphs. Inform and Comput 206:1264\u20131275","journal-title":"Inform and Comput"},{"key":"872_CR4","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-642-11269-0_7","volume":"5917","author":"J Daligault","year":"2009","unstructured":"Daligault J, Thomass\u00e9 S (2009) On finding directed trees with many leaves. International Workshop on Parameterized and Exact Computation, Lecture Notes in Computer Science 5917:86\u201397","journal-title":"International Workshop on Parameterized and Exact Computation, Lecture Notes in Computer Science"},{"issue":"4","key":"872_CR5","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige U (1998) A threshold of $$\\ln n$$ for approximation set cover. J ACM 45(4):634\u2013652","journal-title":"J ACM"},{"key":"872_CR6","unstructured":"Fernandes CG, Lintzmayer CN (2020) Leafy spanning arborescences in DAGs. In Proceedings of the 14th Latin American Symposium on Theoretical Informatics (LATIN), Lecture Notes in Computer Science, vol. 12118, pp. 1\u201313"},{"issue":"1","key":"872_CR7","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0020-0190(94)90139-2","volume":"52","author":"G Galbiati","year":"1994","unstructured":"Galbiati G, Maffioli F, Morzenti A (1994) A short note on the approximability of the maximum leaves spanning tree problem. Inf Process Lett 52(1):45\u201349. https:\/\/doi.org\/10.1016\/0020-0190(94)90139-2","journal-title":"Inf Process Lett"},{"key":"872_CR8","volume-title":"Computers and Intractability","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and Intractability. W.H. Freeman and Co., New York"},{"key":"872_CR9","doi-asserted-by":"crossref","unstructured":"Guha S, Khuller S (1996) Approximation algorithms for connected dominating sets. In Proceedings of the 4th Annual European Symposium on Algorithms (ESA), Lecture Notes in Computer Science, vol. 1136, pp. 179\u2013193","DOI":"10.1007\/3-540-61680-2_55"},{"key":"872_CR10","first-page":"223","volume":"74","author":"BL Hartnell","year":"2005","unstructured":"Hartnell BL, Vestergaard PD (2005) Dominating sets with at most $$k$$ components. Ars Combin 74:223\u2013229","journal-title":"Ars Combin"},{"issue":"5","key":"872_CR11","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1007\/s11036-005-3368-5","volume":"10","author":"A J\u00fcttner","year":"2005","unstructured":"J\u00fcttner A, Magi A (2005) Tree based broadcast in ad hoc networks. Mobile Netw Appl 10(5):753\u2013762","journal-title":"Mobile Netw Appl"},{"key":"872_CR12","first-page":"57","volume":"8","author":"M Kouider","year":"2006","unstructured":"Kouider M, Vestergaard PD (2006) Generalized connected domination in graphs. Discrete Math Theor Compu Sc 8:57\u201364","journal-title":"Discrete Math Theor Compu Sc"},{"issue":"1","key":"872_CR13","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1006\/jagm.1998.0944","volume":"29","author":"H Lu","year":"1998","unstructured":"Lu H, Ravi R (1998) Approximating maximum leaf spanning trees in almost linear time. J Algorithms 29(1):132\u2013141","journal-title":"J Algorithms"},{"issue":"1","key":"872_CR14","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10898-005-8466-1","volume":"35","author":"M Min","year":"2006","unstructured":"Min M, Du H, Jia X, Huang CX, Huang SCH, Wu W (2006) Improving construction for connected dominating set with Steiner tree in wireless sensor networks. J Global Optimization 35(1):111\u2013119. https:\/\/doi.org\/10.1007\/s10898-005-8466-1","journal-title":"J Global Optimization"},{"key":"872_CR15","doi-asserted-by":"crossref","unstructured":"Pope J, Simon R (2015) Efficient one-to-many broadcasting for resource-constrained wireless networks. In Proceedings of the 40th Annual IEEE Conference on Local Computer Networks (LCN), pp. 518\u2013525","DOI":"10.1109\/LCN.2015.7366366"},{"key":"872_CR16","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.endm.2017.10.035","volume":"62","author":"MF Reis","year":"2017","unstructured":"Reis MF, Felice MCS, Lee O, Usberti FL (2017) A 3-approximation algorithm for the maximum leaf $$k$$-forest problem. Electron Notes Discrete Math 62:201\u2013206","journal-title":"Electron Notes Discrete Math"},{"key":"872_CR17","doi-asserted-by":"crossref","unstructured":"Solis-Oba R (1998) 2-approximation algorithm for finding a spanning tree with maximum number of leaves. In Proceedings of the 6th Annual European Symposium on Algorithms (ESA), Lecture Notes in Computer Science, vol. 1461, pp. 441\u2013452","DOI":"10.1007\/3-540-68530-8_37"},{"key":"872_CR18","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/s00453-015-0080-0","volume":"77","author":"R Solis-Oba","year":"2017","unstructured":"Solis-Oba R, Bonsma P, Lowski S (2017) A 2-approximation algorithm for finding a spanning tree with maximum number of leaves. Algorithmica 77:374\u2013388","journal-title":"Algorithmica"},{"key":"872_CR19","doi-asserted-by":"crossref","unstructured":"Zheng J, Jamalipour A (eds.) (2009) Wireless Sensor Networks: A Networking Perspective. John Wiley & Sons","DOI":"10.1002\/9780470443521"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00872-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00872-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00872-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T06:15:19Z","timestamp":1660371319000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00872-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,10]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["872"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00872-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2022,6,10]]},"assertion":[{"value":"24 May 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 June 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}