Johan Håstad
- 1.S. ARORA, C. LUND, R. MOTWAN{, M. SUDAN AND M. SZEGEDY. Proof verification and intractability of approximation problems. 33rd FOCS, 1992, pp 14-23.Google Scholar
- 2.S. ARORA AND S. SAFRA. Probabilistic checking of proofs: a new characterization of NP. 33rd FOCS, 1992 2-13.Google ScholarDigital Library
- 3.R. B AR-YEHUDA AND S. EVEN A linear time approximation algorithm for the weighted vertex cover algorithm, Journal of Algorithms, 1991, Vol 2, pp 198-210.Google ScholarCross Ref
- 4.M. BELLARE, D. COPPERSMITH, J. HASTAD, M. KIWI, AND M. SUDAN, Linearity testing in characteristic two, IEEE Transactions on Information, Vol 42, No 6, November 1996, pp 1781-1796. Google ScholarCross Ref
- 5.M. BELLARE, O. GOLDREICH AND M. SUDAN Free Bits, PCPs and Non-Approximability--Towards tight Results. 36th FOCS, 1995, pp 422-431. See also a more complete version available from ECCC. Google ScholarDigital Library
- 6.M. BELLARE, S. GOLDWASSER, C. LUND AND A. RUS- SELL. Efficient probabilistically checkable proofs and applications to approximation. 25th STOC, 1993, pp 294-304. (See also Errata sheet in STOC94). Google ScholarDigital Library
- 7.M. BEN-OR, S. GOLDWASSER, J. KILIAN, AND A. WICDERSON Multi-prover interactive proofs: How to remove intractability assumptions. 20th STOC, 1988, pp 113-131. Google ScholarDigital Library
- 8.U. FEIGE AND M. GOEMANS Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT, 3rd iSTCS, 1995, pp 182-189. Google Scholar
- 9.U. FEIGE, $. GOLDWASSER, L. LOVASZ, S. SAFRA, AND M. SZEGEDY. Interactive proofs and the hardness of approximating cliques. Journal of the ACM, 1996, Vol 43:2, pp 268-292. Google ScholarDigital Library
- 10.M.R. GARF. Y AND D.S. JOHNSSON, Computers and Intractability, W.H. Freeman and Company, 1979.Google Scholar
- 11.M. GOEMANS ANO D. WILLIAMSON .878-approximation algorithms for Max-Cut and Max-2-SAT, 25th STOC, 1994, pp 422-431. Google ScholarDigital Library
- 12.J. H~.STAD Clique is hard to approximate within n1-~ 37th FOCS, 1996, pp 627-636. There is also an updated version with the same name and a simpler proof. Google ScholarDigital Library
- 13.D.S. JOHNSSON Approximation algorithms for combinatorial problems, J. Computer and System Sciences, 1974, Vol 9, pp 256-278.Google ScholarDigital Library
- 14.C. PAPADIMITRIOU AND M. YANNAKAKIS Optimization, approximation and complexity classes. Journal of Computer and System Sciences, Vol 43, 1991, pp 425- 440.Google ScholarCross Ref
- 15.E. PETRANK The hardness of approximation, 2nd ISTCS, 1993, pp 275-284.Google Scholar
- 16.R. RAZ A parallel repetition theorem, 27th STOC, 1995, pp 447-456. Google ScholarDigital Library
- 17.L. TREVISAN, G. $ORKIN, M. SUDAN, AND D. WILLIAMSON Gadgets, approximation and linear programming, 37th FOCS, 1996, pp 617-626. Google ScholarDigital Library
- 18.O. VERBITSKY Towards the parallel repetition conjecture, Theoretical Computer Science, Vol 157, 1996, pp 277-282. Google ScholarDigital Library
Index Terms
- Some optimal inapproximability results
Recommendations
Optimal algorithms and inapproximability results for every CSP?
STOC '08: Proceedings of the fortieth annual ACM symposium on Theory of computingSemidefinite Programming(SDP) is one of the strongest algorithmic techniques used in the design of approximation algorithms. In recent years, Unique Games Conjecture(UGC) has proved to be intimately connected to the limitations of Semidefinite ...
Some optimal inapproximability results
We prove optimal, up to an arbitrary ε > 0, inapproximability results for Max-E k-Sat for k ≥ 3, maximizing the number of satisfied linear equations in an over-determined system of linear equations modulo a prime p and Set Splitting. As a consequence of ...
Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of $\alpha_{\text{\tiny{GW}}} + \epsilon$ for all $\epsilon > 0$; here $\alpha_{\text{\tiny{GW}}} \approx .878567$ denotes the ...
Comments