{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T17:53:54Z","timestamp":1777398834818,"version":"3.51.4"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031598340","type":"print"},{"value":"9783031598357","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-59835-7_25","type":"book-chapter","created":{"date-parts":[[2024,5,21]],"date-time":"2024-05-21T07:05:03Z","timestamp":1716275103000},"page":"337-350","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A $$\\nicefrac {4}{3}$$-Approximation for\u00a0the\u00a0Maximum Leaf Spanning Arborescence Problem in\u00a0DAGs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3664-3687","authenticated-orcid":false,"given":"Meike","family":"Neuwohner","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,22]]},"reference":[{"issue":"1","key":"25_CR1","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1137\/070710494","volume":"23","author":"N Alon","year":"2009","unstructured":"Alon, N., Fomin, F.V., Gutin, G., Krivelevich, M., Saurabh, S.: Spanning directed trees with many leaves. SIAM J. Discret. Math. 23(1), 466\u2013476 (2009). https:\/\/doi.org\/10.1137\/070710494","journal-title":"SIAM J. Discret. Math."},{"key":"25_CR2","doi-asserted-by":"publisher","unstructured":"Binkele-Raible, D., Fernau, H., Fomin, F.V., Lokshtanov, D., Saurabh, S., Villanger, Y.: Kernel(s) for problems with no kernel: on out-trees with many leaves. ACM Trans. Algorithms 8(4) (2012). https:\/\/doi.org\/10.1145\/2344422.2344428","DOI":"10.1145\/2344422.2344428"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.jda.2011.06.005","volume":"12","author":"P Bonsma","year":"2012","unstructured":"Bonsma, P.: Max-leaves spanning tree is APX-hard for cubic graphs. J. Discrete Algorithms 12, 14\u201323 (2012). https:\/\/doi.org\/10.1016\/j.jda.2011.06.005","journal-title":"J. Discrete Algorithms"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-642-11269-0_7","volume-title":"Parameterized and Exact Computation","author":"J Daligault","year":"2009","unstructured":"Daligault, J., Thomass\u00e9, S.: On finding directed trees with many leaves. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol. 5917, pp. 86\u201397. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-11269-0_7"},{"key":"25_CR5","doi-asserted-by":"publisher","unstructured":"Drescher, M., Vetta, A.: An approximation algorithm for the maximum leaf spanning arborescence problem. ACM Trans. Algorithms 6(3) (2010). https:\/\/doi.org\/10.1145\/1798596.1798599","DOI":"10.1145\/1798596.1798599"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"125","DOI":"10.6028\/jres.069b.013","volume":"69B","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with 0,1-vertices. J. Res. Natl. Bureau Stand. Sect. B Math. Math. Phys. 69B, 125\u2013130 (1965). https:\/\/doi.org\/10.6028\/jres.069b.013","journal-title":"J. Res. Natl. Bureau Stand. Sect. B Math. Math. Phys."},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.dam.2021.06.018","volume":"323","author":"CG Fernandes","year":"2022","unstructured":"Fernandes, C.G., Lintzmayer, C.N.: Leafy spanning arborescences in DAGs. Discret. Appl. Math. 323, 217\u2013227 (2022). https:\/\/doi.org\/10.1016\/j.dam.2021.06.018","journal-title":"Discret. Appl. Math."},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.jcss.2023.02.006","volume":"135","author":"CG Fernandes","year":"2023","unstructured":"Fernandes, C.G., Lintzmayer, C.N.: How heavy independent sets help to find arborescences with many leaves in DAGs. J. Comput. Syst. Sci. 135, 158\u2013174 (2023). https:\/\/doi.org\/10.1016\/j.jcss.2023.02.006","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"25_CR9","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.: A short note on the approximability of the maximum leaves spanning tree problem. Inf. Process. Lett. 52(1), 45\u201349 (1994). https:\/\/doi.org\/10.1016\/0020-0190(94)90139-2","journal-title":"Inf. Process. Lett."},{"key":"25_CR10","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., USA (1990)"},{"issue":"4","key":"25_CR11","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S Guha","year":"1998","unstructured":"Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20(4), 374\u2013387 (1998). https:\/\/doi.org\/10.1007\/PL00009201","journal-title":"Algorithmica"},{"key":"25_CR12","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations: Proceedings of a symposium on the Complexity of Computer Computations. Plenum Press (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"1","key":"25_CR13","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1137\/S0097539795286612","volume":"28","author":"S Khanna","year":"1998","unstructured":"Khanna, S., Motwani, R., Sudan, M., Vazirani, U.: On syntactic versus computational views of approximability. SIAM J. Comput. 28(1), 164\u2013191 (1998). https:\/\/doi.org\/10.1137\/S0097539795286612","journal-title":"SIAM J. Comput."},{"key":"25_CR14","doi-asserted-by":"publisher","unstructured":"Neuwohner, M.: Passing the limits of pure local search for weighted k-set packing. In: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1090\u20131137. Society for Industrial and Applied Mathematics (2023). https:\/\/doi.org\/10.1137\/1.9781611977554.ch41","DOI":"10.1137\/1.9781611977554.ch41"},{"issue":"1\u20133","key":"25_CR15","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.tcs.2004.08.013","volume":"329","author":"L Ruan","year":"2004","unstructured":"Ruan, L., Du, H., Jia, X., Wu, W., Li, Y., Ko, K.I.: A greedy approximation for minimum connected dominating sets. Theoret. Comput. Sci. 329(1\u20133), 325\u2013330 (2004). https:\/\/doi.org\/10.1016\/j.tcs.2004.08.013","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-29116-6_7","volume-title":"Approximation and Online Algorithms","author":"N Schwartges","year":"2012","unstructured":"Schwartges, N., Spoerhase, J., Wolff, A.: Approximation algorithms for the maximum leaf spanning tree problem on acyclic digraphs. In: Solis-Oba, R., Persiano, G. (eds.) WAOA 2011. LNCS, vol. 7164, pp. 77\u201388. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29116-6_7"},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/s00453-015-0080-0","volume":"77","author":"R Solis-Oba","year":"2015","unstructured":"Solis-Oba, R., Bonsma, P.S., Lowski, S.: A 2-approximation algorithm for finding a spanning tree with maximum number of leaves. Algorithmica 77, 374\u2013388 (2015). https:\/\/doi.org\/10.1007\/s00453-015-0080-0","journal-title":"Algorithmica"},{"key":"25_CR18","doi-asserted-by":"publisher","unstructured":"Thiery, T., Ward, J.: An improved approximation for maximum weighted k-set packing. In: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1138\u20131162. Society for Industrial and Applied Mathematics (2023). https:\/\/doi.org\/10.1137\/1.9781611977554.ch42","DOI":"10.1137\/1.9781611977554.ch42"},{"key":"25_CR19","doi-asserted-by":"publisher","unstructured":"Trevisan, L.: Non-approximability results for optimization problems on bounded degree instances. In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, STOC 2001, pp. 453\u2013461. Association for Computing Machinery, New York (2001). https:\/\/doi.org\/10.1145\/380752.380839","DOI":"10.1145\/380752.380839"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-59835-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,21]],"date-time":"2024-05-21T07:14:07Z","timestamp":1716275647000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-59835-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031598340","9783031598357"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-59835-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The author has no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wroc\u0142aw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ipco2024.ii.uni.wroc.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}