<p>The paper by Bläser, Panagiotou, and Rao deals with concentration of the tour produced by Christofides' algorithm. No average-case approximation ratio is claimed, except for some experimental results.</p>

<p>The paper by Röglin and Vöcking (Math. Program., 2007) and an earlier paper by Beier and Vöcking (SIAM J. Comput., 2006) roughly state that smoothed polynomial time is equivalent to randomized pseudo-polynomial time. Here, pseudo-polynomial means running-time polynomial in the input size and the magnitude of the coefficients that are perturbed. This rules out smoothed polynomial complexity for strongly NP-hard optimization problems (unless NP=ZPP).</p>

<p>Concerning smoothed analysis and approximation, there are only very few papers that address specific problems or algorithms (Englert, Röglin, and Vöcking for the 2-opt heuristic for TSP; Bläser, Manthey, and Rao as well as Curticapean and Künnemann for partitioning heuristics; Karger and Onak for multi-dimensional packing). However, I am not aware of any structural connections between inapproximability and smoothed analysis.</p>

CC BY-SA 3.0
2013-10-17T07:54:33.967Z
2013-10-17T07:54:33.967Z
Bodo Manthey
<p>Smoothed analysis has been applied many times to understand the runtime of exact algorithms for many problems like linear programming and k-means. There are fairly general results in this realm, for example Heiko Röglin and Berthold Vöcking, <a href="http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.7960" rel="noreferrer">Smoothed analysis of integer programming</a>, 2005.
Some of these general results seem to rely on isolation lemmas in order to produce an instance with a unique optimal solution.
Assuming <span class="math-container">$\mathsf{NP}\ne \mathsf{ZPP}$</span>, this paper rules out the existence of smoothed polynomial time algorithms for <span class="math-container">$\mathsf{NP}$</span>-hard problems.</p>
<p>Some work has been done on smoothed analysis for approximation algorithm ratios.
There is Rao Raghavendra, <a href="http://mmcr.iisc.ernet.in:8008/cgi-bin/nwayfiles.py/m3/CSA/2012-08-09_Dr.%20Raghavedra%20Rao%20B.%20V._MP4.mp4?client=flash&amp;button=View" rel="noreferrer">Probabilistic and Smoothed Analysis of Approximation Algorithms</a>, 2008 which attempts to give an improved approximation bound for the Christofides algorithm with smoothed analysis. No explicit approximation ratio is given, though.</p>
<h3>Is there any reason for why hardness of approximation results should limit the approximation ratios of algorithms that run in smoothed polynomial time? Do the results in Heiko Röglin and Berthold Vöcking's paper also apply for approximation algorithms?</h3>

<cc.complexity-theory><approximation-algorithms><approximation-hardness><smoothed-analysis>
Smoothed analysis of approximation algorithms
Aaron Schild
# Smoothed analysis of approximation algorithms

(Asked by: username_0 on 2013-05-12)

Smoothed analysis has been applied many times to understand the runtime of exact algorithms for many problems like linear programming and k-means. There are fairly general results in this realm, for example Heiko Röglin and Berthold Vöcking, [Smoothed analysis of integer programming](http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.7960), 2005.
Some of these general results seem to rely on isolation lemmas in order to produce an instance with a unique optimal solution.
Assuming $\mathsf{NP}\ne \mathsf{ZPP}$, this paper rules out the existence of smoothed polynomial time algorithms for $\mathsf{NP}$-hard problems.

Some work has been done on smoothed analysis for approximation algorithm ratios.
There is Rao Raghavendra, [Probabilistic and Smoothed Analysis of Approximation Algorithms](http://mmcr.iisc.ernet.in:8008/cgi-bin/nwayfiles.py/m3/CSA/2012-08-09_Dr.%20Raghavedra%20Rao%20B.%20V._MP4.mp4?client=flash&button=View), 2008 which attempts to give an improved approximation bound for the Christofides algorithm with smoothed analysis. No explicit approximation ratio is given, though.

### Is there any reason for why hardness of approximation results should limit the approximation ratios of algorithms that run in smoothed polynomial time? Do the results in Heiko Röglin and Berthold Vöcking's paper also apply for approximation algorithms?

**Tags:** cc.complexity-theory, approximation-algorithms, approximation-hardness, smoothed-analysis

---

## 1 answers

### Answer by username_1 on 2013-10-17. Score: 3 | Accepted answer

The paper by Bläser, Panagiotou, and Rao deals with concentration of the tour produced by Christofides' algorithm. No average-case approximation ratio is claimed, except for some experimental results.

The paper by Röglin and Vöcking (Math. Program., 2007) and an earlier paper by Beier and Vöcking (SIAM J. Comput., 2006) roughly state that smoothed polynomial time is equivalent to randomized pseudo-polynomial time. Here, pseudo-polynomial means running-time polynomial in the input size and the magnitude of the coefficients that are perturbed. This rules out smoothed polynomial complexity for strongly NP-hard optimization problems (unless NP=ZPP).

Concerning smoothed analysis and approximation, there are only very few papers that address specific problems or algorithms (Englert, Röglin, and Vöcking for the 2-opt heuristic for TSP; Bläser, Manthey, and Rao as well as Curticapean and Künnemann for partitioning heuristics; Karger and Onak for multi-dimensional packing). However, I am not aware of any structural connections between inapproximability and smoothed analysis.


---

