A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
An approximation algorithm for the maximum leaf spanning arborescence problem
2010
ACM Transactions on Algorithms
We present an O( √ opt)-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 O(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.
doi:10.1145/1798596.1798599
fatcat:vnwi5bkzinf7fgvkjojbl7j2sy