Smoothed Analysis of the Successive Shortest Path Algorithm

The minimum-cost flow problem is a classic problem in combinatorial optimization with various applications. Several pseudo-polynomial, polynomial, and strongly polynomial algorithms have been developed in the past decades, and it seems that both the problem and the algorithms are well understood. However, some of the algorithms' running times observed in empirical studies contrast the running times obtained by worst-case analysis not only in the order of magnitude but also in the ranking when compared to each other. For example, the Successive Shortest Path (SSP) algorithm, which has an exponential worst-case running time, seems to outperform the strongly polynomial Minimum-Mean Cycle Canceling algorithm. To explain this discrepancy, we study the SSP algorithm in the framework of smoothed analysis and establish a bound of O(mnφ(m + n log n)) for its smoothed running time. This shows that worst-case instances for the SSP algorithm are not robust and unlikely to be encountered in practice.

[1]  G. Minty.  Monotone networks , 1960, Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences.

[2]  Robert G. Busacker,et al.  A PROCEDURE FOR DETERMINING A FAMILY OF MINIMUM-COST NETWORK FLOW PATTERNS , 1960 .

[3]  M. Iri.  A NEW METHOD OF SOLVING TRANSPORTATION· NETWORK PROBLEMS , 1960 .

[4]  D. R. Fulkerson,et al.  An Out-of-Kilter Method for Minimal-Cost Flow Problems , 1960 .

[5]  William S. Jewell.  New Methods in Mathematical Programming---Optimal Flow Through Networks with Gains , 1962 .

[6]  M. Klein.  A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems , 1966 .

[7]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[8]  Norman Zadeh,et al.  A bad network problem for the simplex method and other minimum cost flow algorithms , 1973, Math. Program..

[9]  Éva Tardos,et al.  A strongly polynomial minimum cost circulation algorithm , 1985, Comb..

[10]  J. Orlin.  Working Paper Alfred P. Sloan School of Management Genuinely Polynominal Simplex and Non-simplex Algorithms for the Minimum Cost Flow Problem Genuinely Polynominal Simplex and Non-simplex Algorithms for the Minimum Cost Flow Problem , 2008 .

[11]  James B. Orlin,et al.  A faster strongly polynomial minimum cost flow algorithm , 1993, STOC '88.

[12]  A. Goldberg,et al.  Finding minimum-cost circulations by canceling negative cycles , 1989, JACM.

[13]  Andrew V. Goldberg,et al.  Finding Minimum-Cost Circulations by Successive Approximation , 1990, Math. Oper. Res..

[14]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[15]  Andrew V. Goldberg,et al.  Tight bounds on the number of minimum-mean cycle cancellations and related results , 1991, SODA '91.

[16]  James B. Orlin.  A Faster Strongly Polynomial Minimum Cost Flow Algorithm , 1993, Oper. Res..

[17]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[18]  Rajesh K. Gupta,et al.  Faster maximum and minimum mean cycle algorithms for system-performance analysis , 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[19]  Jens Vygen,et al.  On dual minimum cost flow algorithms , 2002, Math. Methods Oper. Res..

[20]  René Beier,et al.  Random knapsack in expected polynomial time , 2003, STOC '03.

[21]  Yan-yan Lam,et al.  Algorithms for the minimum cost flow problem , 2004 .

[22]  D. Spielman,et al.  Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time , 2004 .

[23]  René Beier,et al.  Typical properties of winners and losers in discrete optimization , 2004, STOC '04.

[24]  René Beier,et al.  Typical Properties of Winners and Losers in Discrete Optimization , 2006, SIAM J. Comput..

[25]  Roman Vershynin,et al.  Beyond Hirsch Conjecture: Walks on Random Polytopes and Smoothed Complexity of the Simplex Method , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[26]  Jens Vygen,et al.  The Book Review Column1 , 2020, SIGACT News.

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

[28]  Eric V. Denardo,et al.  Flows in Networks , 2011 .

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

[30]  Zoltán Király,et al.  Efficient implementations of minimum-cost flow algorithms , 2012, ArXiv.

[31]  Heiko Röglin,et al.  Finding Short Paths on Polytopes by the Shadow Vertex Algorithm , 2013, ICALP.

[32]  Péter Kovács,et al.  Minimum-cost flow algorithms: an experimental evaluation , 2015, Optim. Methods Softw..