{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:44:53Z","timestamp":1759063493256,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642291159"},{"type":"electronic","value":"9783642291166"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29116-6_7","type":"book-chapter","created":{"date-parts":[[2012,3,26]],"date-time":"2012-03-26T09:59:55Z","timestamp":1332755995000},"page":"77-88","source":"Crossref","is-referenced-by-count":7,"title":["Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs"],"prefix":"10.1007","author":[{"given":"Nadine","family":"Schwartges","sequence":"first","affiliation":[]},{"given":"Joachim","family":"Spoerhase","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-540-73420-8_32","volume-title":"Automata, Languages and Programming","author":"N. Alon","year":"2007","unstructured":"Alon, N., Fomin, F.V., Gutin, G., Krivelevich, M., Saurabh, S.: Parameterized Algorithms for Directed Maximum Leaf Problems. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 352\u2013362. Springer, Heidelberg (2007)"},{"issue":"1","key":"7_CR2","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. Discrete Math.\u00a023(1), 466\u2013476 (2009)","journal-title":"SIAM J. Discrete Math."},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-642-13182-0_31","volume-title":"Computer Science \u2013 Theory and Applications","author":"D. Binkele-Raible","year":"2010","unstructured":"Binkele-Raible, D., Fernau, H.: A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem. In: Ablayev, F., Mayr, E.W. (eds.) CSR 2010. LNCS, vol.\u00a06072, pp. 328\u2013339. Springer, Heidelberg (2010)"},{"issue":"4","key":"7_CR4","doi-asserted-by":"publisher","first-page":"1652","DOI":"10.1137\/100801251","volume":"25","author":"P.S. Bonsma","year":"2011","unstructured":"Bonsma, P.S., Zickfeld, F.: A 3\/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs. SIAM J. Disc. Math.\u00a025(4), 1652\u20131666 (2011)","journal-title":"SIAM J. Disc. Math."},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Byrka, J., Grandoni, F., Rothvo\u00df, T., Sanit\u00e0, L.: An improved LP-based approximation for Steiner tree. In: Proc. 42nd ACM Symp. Theory Comput. (STOC), pp. 583\u2013592 (2010)","DOI":"10.1145\/1806689.1806769"},{"key":"7_CR6","unstructured":"Charikar, M., Chekuri, C., Cheung, T.Y., Dai, Z., Goel, A., Guha, S., Li, M.: Approximation algorithms for directed Steiner problems. In: Proc. 9th Annu. ACM-SIAM Symp. Discrete Algorithms (SODA), pp. 192\u2013200 (1998)"},{"issue":"2","key":"7_CR7","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.jcss.2009.06.005","volume":"76","author":"J. Daligault","year":"2010","unstructured":"Daligault, J., Gutin, G., Kim, E.J., Yeo, A.: FPT algorithms and kernels for the directed k-leaf problem. J. Comput. Syst. Sci.\u00a076(2), 144\u2013152 (2010)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR8","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.\u00a05917, pp. 86\u201397. Springer, Heidelberg (2009)"},{"issue":"3","key":"7_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1798596.1798599","volume":"6","author":"M. Drescher","year":"2010","unstructured":"Drescher, M., Vetta, A.: An approximation algorithm for the maximum leaf spanning arborescence problem. ACM Trans. Algorithms\u00a06(3), 1\u201318 (2010)","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"7_CR10","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. Inform. Process. Lett.\u00a052(1), 45\u201349 (1994)","journal-title":"Inform. Process. Lett."},{"key":"7_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., New York (1979)"},{"issue":"1","key":"7_CR12","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/0404010","volume":"4","author":"D.J. Kleitman","year":"1991","unstructured":"Kleitman, D.J., West, D.B.: Spanning trees with many leaves. SIAM J. Discrete Math.\u00a04(1), 99\u2013106 (1991)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"7_CR13","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1006\/jagm.1998.0944","volume":"29","author":"H.I. Lu","year":"1998","unstructured":"Lu, H.I., Ravi, R.: Approximating maximum leaf spanning trees in almost linear time. J. Algorithms\u00a029(1), 132\u2013141 (1998)","journal-title":"J. Algorithms"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/3-540-68530-8_37","volume-title":"Algorithms - ESA \u201998","author":"R. Solis-Oba","year":"1998","unstructured":"Solis-Oba, R.: 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves. In: Bilardi, G., Italiano, G.F., Pietracaprina, A., Pucci, G. (eds.) ESA 1998. LNCS, vol.\u00a01461, pp. 441\u2013452. Springer, Heidelberg (1998)"},{"issue":"1","key":"7_CR15","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF02523690","volume":"18","author":"A. Zelikovsky","year":"1997","unstructured":"Zelikovsky, A.: A series of approximation algorithms for the acyclic directed Steiner tree problem. Algorithmica\u00a018(1), 99\u2013110 (1997)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29116-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T00:54:51Z","timestamp":1676768091000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-29116-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642291159","9783642291166"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29116-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}