Linear time approximation schemes for the gale-berlekamp game and related minimization problems

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2009, Pages 313-322

  Karpinski, Marek ^a   Schudy, Warren ^b  

^a UNIVERSITY OF BONN   (Germany)

^b Brown University   (United States)

Author keywords

Approximation algorithms; Correlation and hierarchical clustering; Dense instances; Gale berlekamp game; Linear time approximation schemes; Minimum constraint satisfaction; Nearest codeword problem

Indexed keywords

CORRELATION AND HIERARCHICAL CLUSTERING; DENSE INSTANCES; GALE-BERLEKAMP GAME; LINEAR TIME APPROXIMATION SCHEMES; MINIMUM CONSTRAINT SATISFACTION; NEAREST CODEWORD PROBLEM;

COMPUTATION THEORY; ENCODING (SYMBOLS); MAXIMUM LIKELIHOOD; OPTIMIZATION; STEELMAKING;

APPROXIMATION ALGORITHMS;

EID: 70350683772     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1536414.1536458     Document Type: Conference Paper

References (23)

1. N. Ailon and M. Charikar. Fitting tree metrics: Hierarchical clustering and phylogeny. In Proc. 46th IEEE FOCS, pages 73-82, 2005.
2. N. Alon, W. Fernandez de la Vega, R. Kannan, and M. Karpinski. Random Sampling and Approximation of MAX-CSP Problems. In Proc. 34th ACM STOC, pages 232-239, 2002. Journal version in J. Comput. System Sciences, 67(2):212-243, 2003.
3. N. Alon, R. Panigrahy, and S. Yekhanin. Deterministic Approximation Algorithms for the Nearest Codeword Problem. Technical report, Elec. Coll. on Comp. Compl., ECCC TR08-065, 2008.
4. S. Arora, L. Babai, J. Stern, and Z. Sweedyk. The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations. In Proc. 34th IEEE FOCS, pages 724-733, Nov 1993. Journal version in J. Comput. System Sciences, 54(2):317-331, 1997.
5. S. Arora, A. Frieze, and H. Kaplan. A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement Problems. In Proc. 37th IEEE FOCS, pages 21-30, Oct 1996. Journal version in Mathematical Programming, 92(1):1-36, 2002.
6. S. Arora, D. Karger, and M. Karpinski. Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems. In Proc. 27th ACM STOC, pages 284-293, 1995. Journal version in J. Comput. System Sciences, 58(1):193-210, 1999.
7. C. Bazgan, W. Fernandez de la Vega, and M. Karpinski. Polynomial Time Approximation Schemes for Dense Instances of Minimum Constraint Satisfaction. Random Structures and Algorithms, 23(1):73-91, 2003.
8. P. Berman and M. Karpinski. Approximating Minimum Unsatisfiability of Linear Equations. In Proc. 13th ACM-SIAM SODA, pages 514-516, 2002.
9. P. Berman and M. Karpinski. Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION. In Proc. 29th ICALP, LNCS 2380, pages 623-632. Springer, 2002.
10. J. Carlson and D. Stolarski. The Correct Solution to Berlekamp's Switching Game. Discrete Mathematics, 287(1-3):145-150, 2004.
11. I. Dinur, G. Kindler, R. Raz, and S. Safra. Approximating CVP to Within Almost-Polynomial Factors is NP-Hard. Combinatorica, 23(2):205-243, 2003.
12. U. Feige and L. Lovasz. Two prover one round proof systems: Their power and their problems. In Proc. 24th STOC, pages 733-741, 1992.
13. W. Fernandez de la Vega. MAX-CUT has a Randomized Approximation Scheme in Dense Graphs. Random Struct. Algorithms, 8(3):187-198, 1996.
14. W. Fernandez de la Vega, R. Kannan, and M. Karpinski. Approximation of Global MAX-CSP Problems. Technical Report TR06-124, Electronic Colloquim on Computation Complexity, 2006.
15. P. C. Fishburn and N. J. Sloane. The Solution to Berlekamp's Switching Game. Discrete Math., 74(3):263-290, 1989.
16. A. M. Frieze and R. Kannan. Quick Approximation to Matrices and Applications. Combinatorica, 19(2):175-220, 1999.
17. I. Giotis and V. Guruswami. Correlation clustering with a fixed number of clusters. Theory of Computing, 2(1):249-266, 2006.
18. A. Gupta and K. Talvar. Approximating unique games. In Proc. 17th ACM-SIAM SODA, pages 99-106, 2006.
19. S. V. Lokam. Spectral Methods for Matrix Rigidity with Applications to Size-Depth Tradeoffs and Communication Complexity. In Proc. 36th IEEE FOCS, pages 6-15, 1995.
20. C. Mathieu and W. Schudy. Yet Another Algorithm for Dense Max Cut: Go Greedy. In Proc. 19th ACM-SIAM SODA, pages 176-182, 2008.
21. R. Roth and K. Viswanathan. On the Hardness of Decoding the Gale-Berlekamp Code. IEEE Transactions on Information Theory, 54(3):1050-1060, March 2008.
22. M. Rudelson and R. Vershynin. Sampling from large matrices: An approach through geometric functional analysis. J. ACM, 54(4):21, 2007.
23. J. Spencer. Ten Lectures on the Probabilistic Method. SIAM, Regional Conference Series, second edition, 1994.