Approximation Algorithms for Minimum K -Cut
暂无分享,去创建一个
[1] Vijay V. Vazirani,et al. Finding k Cuts within Twice the Optimal , 1995, SIAM J. Comput..
[2] Vijay V. Vazirani,et al. Finding k-cuts within twice the optimal , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[4] Takeshi Tokuyama,et al. Geometric Algorithms for the Minimum Cost Assignment Problem , 1995, Random Struct. Algorithms.
[5] Dorit S. Hochbaum,et al. Polynomial algorithm for the k-cut problem , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.