Smoothed analysis of integer programming
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adversary specifies the coefficients of an integer program and then (some of) these coefficients are randomly perturbed, e.g., using a Gaussian or a uniform distribution with small standard deviation. In this probabilistic model, we investigate structural properties of ILPs and apply them to the analysis of algorithms. For example, we prove a lower bound on the slack of the optimal solution. As a result of our analysis, we are able to specify the smoothed complexity of classes of ILPs in terms of their worst case complexity. This way, we obtain polynomial smoothed complexity for packing and covering problems with any fixed number of constraints. Previous results of this kind were restricted to the case of binary programs.
KeywordsProbabilistic analysis Integer programming
Mathematics Subject Classification (2000)68Q25 90C10 90C27
Unable to display preview. Download preview PDF.
- 1.Ackermann, H., Newman, A., Röglin, H., Vöcking, B.: Decision making based on approximate and smoothed pareto curves. In: Proceedings of the 16th annual international symposium on algorithms and computation (ISAAC), pp. 675–684 (2005)Google Scholar
- 2.Banderier, C., Beier, R., Mehlhorn, K.: Smoothed analysis of three combinatorial problems. In: Proceedings 28th international symposium on mathematical foundations of computer science (MFCS), vol. 97, pp. 198–207 (2003)Google Scholar
- 3.Beier, R., Vöcking, B.: Probabilistic analysis of knapsack core algorithms. In: Proceedings of the 15th annual symposium on discrete algorithms (SODA), pp. 468–477 (2004)Google Scholar
- 8.Crescenzi, P., Kann, V., Halldorsson, M., Karpinski, M., Woeginger, G.: A compendium of np optimization problems. Http://www.nada.kth.se/~viggo/problemlist/compendium.htmlGoogle Scholar
- 11.Goldberg, A., Marchetti-Spaccamela, A.: On finding the exact solution to a zero-one knapsack problem. In: Proceedings of the 16th Annual ACM Symposium on Theory of Computing (STOC), pp. 359–368 (1984)Google Scholar
- 13.Manthey, B., Reischuk, R.: Smoothed analysis of binary search trees. In: Proceedings of the 16th annual international symposium on algorithms and computation (ISAAC), pp. 483–492 (2005)Google Scholar