{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T17:55:03Z","timestamp":1777398903653,"version":"3.51.4"},"reference-count":11,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2010,6,1]],"date-time":"2010-06-01T00:00:00Z","timestamp":1275350400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["28833-04"],"award-info":[{"award-number":["28833-04"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003150","name":"Fonds Qu\u00e9b\u00e9cois de la Recherche sur la Nature et les Technologies","doi-asserted-by":"publisher","award":["NC-98649"],"award-info":[{"award-number":["NC-98649"]}],"id":[{"id":"10.13039\/501100003150","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Algorithms"],"published-print":{"date-parts":[[2010,6]]},"abstract":"<jats:p>\n            We present an\n            <jats:italic>O<\/jats:italic>\n            (\u221aopt)-approximation algorithm for the maximum leaf spanning arborescence problem, where opt is the number of leaves in an optimal spanning arborescence. The result is based upon an\n            <jats:italic>O<\/jats:italic>\n            (1)-approximation algorithm for a special class of directed graphs called willows. Incorporating the method for willow graphs as a subroutine in a local improvement algorithm gives the bound for general directed graphs.\n          <\/jats:p>","DOI":"10.1145\/1798596.1798599","type":"journal-article","created":{"date-parts":[[2010,6,29]],"date-time":"2010-06-29T13:02:22Z","timestamp":1277816542000},"page":"1-18","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["An approximation algorithm for the maximum leaf spanning arborescence problem"],"prefix":"10.1145","volume":"6","author":[{"given":"Matthew","family":"Drescher","sequence":"first","affiliation":[{"name":"McGill University, Quebec, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrian","family":"Vetta","sequence":"additional","affiliation":[{"name":"McGill University, Quebec, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,7,2]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Alon N. Fomin F. Gutin G. Krivelevich M. and Saurabh S. 2007a. Better algorithms and bounds for directed maximum-leaf problems.  Alon N. Fomin F. Gutin G. Krivelevich M. and Saurabh S. 2007a. Better algorithms and bounds for directed maximum-leaf problems.","DOI":"10.1007\/978-3-540-77050-3_26"},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of 34th International Colloquium on Automata, Languages and Programming (ICALP'07)","author":"Alon N.","unstructured":"Alon , N. , Fomin , F. , Gutin , G. , Krivelevich , M. , and Saurabh , S . 2007b. Parameterized algorithms for directed maximum leaf problems . In Proceedings of 34th International Colloquium on Automata, Languages and Programming (ICALP'07) . 352--362. Alon, N., Fomin, F., Gutin, G., Krivelevich, M., and Saurabh, S. 2007b. Parameterized algorithms for directed maximum leaf problems. In Proceedings of 34th International Colloquium on Automata, Languages and Programming (ICALP'07). 352--362."},{"key":"e_1_2_1_3_1","unstructured":"Bonsma P. and Dorn F. 2007. An fpt algorithm for directed spanning k-leaf.  Bonsma P. and Dorn F. 2007. An fpt algorithm for directed spanning k-leaf."},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the 12th Annual European Symposium on Algorithms (ESA'04)","author":"Chlebik M.","unstructured":"Chlebik , M. and Chlebikova , J . 2004. Approximation hardness for dominating set problems . In Proceedings of the 12th Annual European Symposium on Algorithms (ESA'04) . 192--203. Chlebik, M. and Chlebikova, J. 2004. Approximation hardness for dominating set problems. In Proceedings of the 12th Annual European Symposium on Algorithms (ESA'04). 192--203."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)90139-2"},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the European Symposium on Algorithms. 179--193","author":"Guha S.","unstructured":"Guha , S. and Khuller , S . 1996. Approximation algorithms for connected dominating sets . In Proceedings of the European Symposium on Algorithms. 179--193 . Guha, S. and Khuller, S. 1996. Approximation algorithms for connected dominating sets. In Proceedings of the European Symposium on Algorithms. 179--193."},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of the 30th Annual Allerton Conference on Communication, Control and Computing. 533--542","author":"Lu H.","unstructured":"Lu , H. and Ravi , R . 1992. The power of local optimzation: Approximation algorithms for maximum-leaf spanning tree . In Proceedings of the 30th Annual Allerton Conference on Communication, Control and Computing. 533--542 . Lu, H. and Ravi, R. 1992. The power of local optimzation: Approximation algorithms for maximum-leaf spanning tree. In Proceedings of the 30th Annual Allerton Conference on Communication, Control and Computing. 533--542."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0944"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(84)90163-8"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/647908.739992"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(81)90141-1"}],"container-title":["ACM Transactions on Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1798596.1798599","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1798596.1798599","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:22:58Z","timestamp":1750245778000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1798596.1798599"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["10.1145\/1798596.1798599"],"URL":"https:\/\/doi.org\/10.1145\/1798596.1798599","relation":{},"ISSN":["1549-6325","1549-6333"],"issn-type":[{"value":"1549-6325","type":"print"},{"value":"1549-6333","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,6]]},"assertion":[{"value":"2007-08-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-07-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}