Noga Alon
ABSTRACT
We present a new efficient sampling method for approximating r-dimensional Maximum Constraint Satisfaction Problems, MAX-rCSP, on n variables up to an additive error εnr. We prove a newgeneral paradigm in that it suffices, for a given set of constraints, to pick a small uniformly random subset of its variables, and the optimum value of the subsystem induced on these variables gives (after a direct normalization and with high probability) an approximation to the optimum of the whole system up to an additive error of εnr. Our method gives for the first time a polynomial in ε—1 bound on the sample size necessary to carry out the above approximation. Moreover, this bound is independent in the exponent on the dimension r. The above method gives a completely uniform sampling technique for all the MAX-rCSP problems, and improves the best known sample bounds for the low dimensional problems, like MAX-CUT. The method of solution depends on a new result on t he cut norm of random subarrays, and a new sampling technique for high dimensional linear programs. This method could be also of independent interest.
- N. Alon, B. Doerr, T. Luczak and T. Schoen, On the discrepancy of combinatorial rectangles, to appear.]]Google Scholar
- N. Alon and A. Shapira, Testing satisfiability, Proc. of the 13th Annual ACM-SIAM SODA, ACM Press (2002), to appear.]] Google ScholarDigital Library
- S.Arora, D.Karger and M.Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems, Proceedings of the 27th Annual ACM Symposium on Theory of Computing (1995) 284--293; the full paper appeared in J. Comp. System. Sci. 58 (1999), 193--210.]] Google ScholarDigital Library
- K. Azuma, Weighted Sum of Certain Dependent random Variables, Tôhoku (MATH).J. 3 (1967), 357--367.]]Google Scholar
- A. Czumaj, C. Sohler, Testing Hypergraph Coloring, Proc. 28th ICALP'01, LNCS Vol. 2076, Springer, 2001, 493--505.]] Google ScholarDigital Library
- W.Fernandez-de-la-Vega, MAX-CUT has a Randomized Approximation Scheme in Dense Graphs, Random Structures and Algorithms 8 (1996) 187--199.]] Google ScholarDigital Library
- A.M.Frieze and R.Kannan, The Regularity Lemma and approximation schemes for dense problems, Proceedings of the 37th Annual IEEE Symposium on Foundations of Computing, (1996) 12--20.]] Google ScholarDigital Library
- A. M. Frieze and R. Kannan Quick Approximation to matrices and applications, Combinatorica 19 (2) (1999) pp 175--200.]]Google ScholarCross Ref
- M.X.Goemans and D.P.Williamson, .878-Approximation algorithms for MAX~CUT and MAX 2SAT, Proceedings of the 26th Annual ACM Symposium on Theory of Computing, ACM Press (1994), 422--431.]] Google ScholarDigital Library
- O.Goldreich, S.Goldwasser and D.Ron, Property testing and its connection to learning and approximation, Proc. 37th IEEE FOCS 96, 339--348; the full paper appeared in J. ACM 45 (1998), 653--750.]] Google ScholarDigital Library
- W.Hoeffding, Probability inequalities for sums of bounded random variables, Journal of the American Statistical Association 58 (1963) 13--30.]]Google ScholarCross Ref
- S. Khanna, M. Sudan and D. Williamson, A complete classification of the approximability of maximization problems derived from boolean constraint satisfaction, Proc. 29th ACM STOC (1997), 11--20.]] Google ScholarDigital Library
- F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, North Holland, Amsterdam, 1977.]]Google Scholar
- S. J. Szarek, On the best constants in the Khinchin Inequality, Studia (MATH). 58 (1976), 197--208.]]Google Scholar
- V.N. Vapnik and A.Y. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities, Theory of Probability and its Applications, 16(2) (1971), 264--280.]]Google ScholarCross Ref
Index Terms
- Random sampling and approximation of MAX-CSP problems
Recommendations
Limit theorems for random MAX-2-XORSAT
LATIN'10: Proceedings of the 9th Latin American conference on Theoretical InformaticsWe consider random instances of the MAX-2-XORSAT optimization problem. A 2-XOR formula is a conjunction of Boolean equations (or clauses) of the form x⊕y=0 or x⊕y=1. The MAX-2-XORSAT problem asks for the maximum number of clauses which can be satisfied ...
Supermodular functions and the complexity of MAX CSP
Special issue: Boolean and pseudo-boolean funtionsIn this paper we study the complexity of the maximum constraint satisfaction problem (MAX CSP) over an arbitrary finite domain. An instance of MAX CSP consists of a set of variables and a collection of constraints which are applied to certain specified ...
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
We show that a maximum cut of a random graph below the giant-component threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the algorithm solves a more general class of problems, namely binary 2-variable ...
Comments