1 Optimal inapproximability results for MAX-CUT and other 2-variable CSPs?
来源：SIAM J COMPUT( P 0097-5397 E 1095-7111 ) 发表时间: 2007/01
类型：期刊论文,会议论文 为本人加分：21442.782050
2 Vertex cover might be hard to approximate to within 2-epsilon
来源：J COMPUT SYST SCI( P 0022-0000 E 1090-2724 ) 发表时间: 2008/05
类型：期刊论文,会议论文 为本人加分：18479.747508
3 Ruling out PTAs for graph min-bisection, dense k-subgraph, and bipartite clique
来源：SIAM J COMPUT( P 0097-5397 E 1095-7111 ) 发表时间: 2006/01
类型：期刊论文 为本人加分：15728.763645
4 Hardness of approximating the shortest vector problem in lattices
来源：J ACM( P 0004-5411 E 1557-735X ) 发表时间: 2005/09
类型：期刊论文 为本人加分：11527.500000
5 The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Met..
来源：J ACM( P 0004-5411 E 1557-735X ) 发表时间: 2015/02
类型：期刊论文 为本人加分：6095.437500
6 Parameterized complexity of finding subgraphs with hereditary properties
来源：THEOR COMPUT SCI( P 0304-3975 E ) 发表时间: 2002/10
类型：期刊论文,会议论文 为本人加分：5003.691341
7 Nonembeddability theorems via Fourier analysis
来源：MATH ANN( P 0025-5831 E 1432-1807 ) 发表时间: 2006/04
类型：期刊论文 为本人加分：4677.916931
8 Grothendieck-Type Inequalities in Combinatorial Optimization
来源：COMMUN PUR APPL MATH( P 0010-3640 E 1097-0312 ) 发表时间: 2012/07
类型：期刊论文 为本人加分：3561.984629
9 Better inapproximability results for MaxClique, chromatic number and Min-3Lin-Deletion
来源：LECT NOTES COMPUT SC( P 0302-9743 E 1611-3349 ) 发表时间: 2006/01
类型：期刊论文,会议论文 为本人加分：2943.478283
10 Inapproximability results for combinatorial auctions with submodular utility functions
来源：LECT NOTES COMPUT SC( P 0302-9743 E 1611-3349 ) 发表时间: 2005/01
类型：期刊论文,会议论文 为本人加分：1653.856091