Smoothed Analysis of the Squared Euclidean Maximum-Cut Problem

It is well-known that local search heuristics for the Maximum-Cut problem can take an exponential number of steps to find a local optimum, even though they usually stabilize quickly in experiments. To explain this discrepancy we have recently analyzed the simple local search algorithm FLIP in the framework of smoothed analysis, in which inputs are subject to a small amount of random noise. We have shown that in this framework the number of iterations is quasi-polynomial, i.e., it is polynomially bounded in nlogn and φ, where n denotes the number of nodes and φ is a parameter of the perturbation.

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

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

[3]  Berthold Vöcking,et al.  Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP , 2007, SODA '07.

[4]  Shang-Hua Teng,et al.  Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices , 2003, SIAM J. Matrix Anal. Appl..

[5]  Leonard J. Schulman,et al.  Clustering for Edge-Cost Minimization , 1999, Electron. Colloquium Comput. Complex..

[6]  Bodo Manthey,et al.  Smoothed Analysis of the 2-Opt Heuristic for the TSP: Polynomial Bounds for Gaussian Noise , 2013, ISAAC.

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

[8]  Bodo Manthey,et al.  Smoothed Analysis: Analysis of Algorithms Beyond Worst Case , 2011, it Inf. Technol..

[9]  Bodo Manthey,et al.  Smoothed Analysis of the k-Means Method , 2011, JACM.

[10]  Éva Tardos,et al.  Algorithm design , 2005 .

[11]  Leonard J. Schulman,et al.  Clustering for edge-cost minimization (extended abstract) , 2000, STOC '00.

[12]  Matus Telgarsky,et al.  Hartigan's Method: k-means Clustering without Voronoi , 2010, AISTATS.

[13]  Sergei Vassilvitskii,et al.  Worst-Case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-Means Method , 2009, SIAM J. Comput..

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

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

[16]  David M. Mount,et al.  A local search approximation algorithm for k-means clustering , 2004, Comput. Geom..