Author:
Gandhi Rajiv,Hajiaghayi Mohammad Taghi,Kortsarz Guy,Purohit Manish,Sarpatwar Kanthi
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference13 articles.
1. A faster fpt algorithm for finding spanning trees with many leaves;Bonsma,2003
2. The polymatroid Steiner problems;Calinescu;J. Comb. Optim.,2005
3. On finding directed trees with many leaves;Daligault,2009
4. An approximation algorithm for the maximum leaf spanning arborescence problem;Drescher;ACM Trans. Algorithms,2010
5. A short note on the approximability of the maximum leaves spanning tree problem;Galbiati;Inf. Process. Lett.,1994
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献