%0 Journal Article %1 journals/talg/DrescherV10 %A Drescher, Matthew %A Vetta, Adrian %D 2010 %J ACM Trans. Algorithms %K dblp %N 3 %P 46:1-46:18 %T An approximation algorithm for the maximum leaf spanning arborescence problem. %U http://dblp.uni-trier.de/db/journals/talg/talg6.html#DrescherV10 %V 6

@article{journals/talg/DrescherV10, added-at = {2018-11-14T00:00:00.000+0100}, author = {Drescher, Matthew and Vetta, Adrian}, biburl = {https://www.bibsonomy.org/bibtex/2b9905bd6ffbcbeb55846c1c7e4d33634/dblp}, ee = {https://www.wikidata.org/entity/Q56502745}, interhash = {034a595f7d641e5e4e5e86359975e1e3}, intrahash = {b9905bd6ffbcbeb55846c1c7e4d33634}, journal = {ACM Trans. Algorithms}, keywords = {dblp}, number = 3, pages = {46:1-46:18}, timestamp = {2018-11-15T13:24:22.000+0100}, title = {An approximation algorithm for the maximum leaf spanning arborescence problem.}, url = {http://dblp.uni-trier.de/db/journals/talg/talg6.html#DrescherV10}, volume = 6, year = 2010 }