Funder
National Natural Science Foundation of China
Natural Science Foundation of Shandong Province
Subject
General Computer Science,Theoretical Computer Science
Reference27 articles.
1. Approximation and hardness results for the max k-uncut problem;Zhang;Theor. Comput. Sci.,2018
2. Networks, Crowds, and Markets: Reasoning About a Highly Connected World;Easley,2010
3. A polynomial algorithm for the k-cut problem for fixed k;Goldschmidt;Math. Oper. Res.,1994
4. Detecting high log-densities: an O(n1/4) approximation for densest k-subgraph;Bhaskara,2010
5. Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields;Kleinberg;J. ACM,2002
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献