Smoothed complexity of local max-cut and binary max-CSP

We show that the smoothed complexity of the FLIP algorithm for local Max-Cut is at most φ nO(√logn), where n is the number of nodes in the graph and φ is a parameter that measures the magnitude of perturbations applied on its edge weights. This improves the previously best upper bound of φ nO(logn) by Etscheid and Roglin. Our result is based on an analysis of long sequences of flips, which shows that it is very unlikely for every flip in a long sequence to incur a positive but small improvement in the cut weight. We also extend the same upper bound on the smoothed complexity of FLIP to all binary Maximum Constraint Satisfaction Problems.

[1]  Mihalis Yannakakis,et al.  Simple Local Search Problems That are Hard to Solve , 1991, SIAM J. Comput..

[2]  Yuval Peres,et al.  Local max-cut in smoothed polynomial time , 2017, STOC.

[3]  Mihalis Yannakakis,et al.  How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[4]  J J Hopfield,et al.  Neural networks and physical systems with emergent collective computational abilities. , 1982, Proceedings of the National Academy of Sciences of the United States of America.

[5]  Heiko Röglin,et al.  Smoothed Analysis of the Squared Euclidean Maximum-Cut Problem , 2015, ESA.

[6]  Robert Elsässer,et al.  Settling the Complexity of Local Max-Cut (Almost) Completely , 2010, ICALP.

[7]  V. Klee,et al.  HOW GOOD IS THE SIMPLEX ALGORITHM , 1970 .

[8]  Karthekeyan Chandrasekaran,et al.  Improving the smoothed complexity of FLIP for max cut problems , 2019, SODA.

[9]  Christos H. Papadimitriou,et al.  The complexity of pure Nash equilibria , 2004, STOC '04.

[10]  Ruta Mehta,et al.  Smoothed Efficient Algorithms and Reductions for Network Coordination Games , 2018, ITCS.

[11]  Shang-Hua Teng,et al.  Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time , 2001, STOC '01.

[12]  Heiko Röglin,et al.  Smoothed Analysis of Local Search for the Maximum-Cut Problem , 2017, ACM Trans. Algorithms.

[13]  Shang-Hua Teng,et al.  Smoothed analysis: an attempt to explain the behavior of algorithms in practice , 2009, CACM.