Publisher
Springer International Publishing
Reference21 articles.
1. Alon, N., Fomin, F., Gutin, G., Krivelevich, M., Saurabh, S.: Spanning directed trees with many leaves. SIAM J. Disc. Math. 23(1), 466–476 (2009)
2. Arkin, E.M., Hassin, R.: On local search for weighted $$k$$-set packing. Math. Oper. Res. 23(3), 640–648 (1998)
3. Berman, P.: A $$d/2$$ approximation for maximum weight independent set in $$d$$-claw free graphs. Nord. J. Comput. 7(3), 178–184 (2000)
4. Bonsma, P., Zickfeld, F.: A $$3/2$$-approximation algorithm for finding spanning trees with many leaves in cubic graphs. SIAM J. Disc. Math. 25(4), 1652–1666 (2011)
5. Correa, J., Fernandes, C.G., Matamala, M., Wakabayashi, Y.: A $$5/3$$-approximation for finding spanning trees with many leaves in cubic graphs. In: Proceedings of the 5th International Workshop on Approximation and Online Algorithms, WAOA 2007. LNCS, vol. 4927, pp. 184–192 (2008)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献