Author:
Deng Xiaojie,Lin Bingkai,Zhang Chihao
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. Journal of Algorithms 12(2), 308–340 (1991)
2. Avidor, A., Langberg, M.: The multi-multiway cut problem. Theoretical Computer Science 377(1-3), 35–42 (2007)
3. Lecture Notes in Computer Science;H.L. Bodlaender,1997
4. Bousquet, N., Daligault, J., Thomassé, S., Yeo, A., et al: A polynomial kernel for multicut in trees. In: 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, pp. 183–194 (2009)
5. Călinescu, G., Karloff, H., Rabani, Y.: An improved approximation algorithm for multiway cut. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pp. 48–52. ACM (1998)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献