ACM - Normas
Venkatesan Guruswami
Prasad Raghavendra
Rishi Saket
Yi Wu
ACM Transactions on Algorithms
Vertex cover might be hard to approximate to within <mml:math altimg=“si1.gif” overflow=“scroll” xmlns:xocs=“http://www.elsevier.com/xml/xocs/dtd” xmlns:xs=“http://www.w3.org/2001/XMLSchema” xmlns:xsi=“http://www.w3.org/2001/XMLSchema-instance” xmlns=“http://www.elsevier.com/xml/ja/dtd” xmlns:ja=“http://www.elsevier.com/xml/ja/dtd” xmlns:mml=“http://www.w3.org/1998/Math/MathML” xmlns:tb=“http://www.elsevier.com/xml/common/table/dtd” xmlns:sb=“http://www.elsevier.com/xml/common/struct-bib/dtd” xmlns:ce=“http://www.elsevier.com/xml/common/dtd” xmlns:xlink=“http://www.w3.org/1999/xlink” xmlns:cals=“http://www.elsevier.com/xml/common/cals/dtd”><mml:mn>2</mml:mn><mml:mo>?</mml:mo><mml:mi>?</mml:mi></mml:math>
Optimal Inapproximability Results for MAX?CUT and Other 2?Variable CSPs?
On the power of unique 2-prover 1-round games
Projective clustering in high dimensions using core-sets
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant