Matthew Drescher

Learn More
We present an <i>O</i>(&sqrt;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 <i>O</i>(1)-approximation algorithm for a special class of directed graphs called willows. Incorporating the method for willow graphs as a subroutine(More)
  • 1