ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT 论文
2006Computational Complexity引用 221
Complexity and Algorithms in GraphsAdvanced Graph Theory ResearchOptimization and Search Problems
ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT · 相关文章
暂无数据