Author:
Zhu Xianbin,Li Wenjun,Yang Yongjie,Wang Jianxin
Publisher
Springer Science and Business Media LLC
Reference24 articles.
1. Garey M R, Johnson D S. Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: WH Freeman & Co, 1979
2. Chen Z Z, Harada Y, Guo F, et al. An approximation algorithm for maximum internal spanning tree. J Comb Optim, 2018, 35: 955–979
3. Cygan M, Fomin F V, Kowalik L, et al. Parameterized Algorithms. Berlin: Springer, 2015
4. Downey R G, Fellows M R. Parameterized Complexity. Berlin: Springer, 1999
5. Fomin F V, Golovach P A, Simonov K. Parameterized k-clustering: the distance matters! 2019. ArXiv:1902.08559
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献