Smoothed analysis of the successive shortest path algorithm

DOI10.1137/140989893MaRDI QIDQ3457194zbMATH OpenOpenAlexFDO

Authors Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin, Clemens Rösner

Publication date 11 December 2015

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1501.05493

zbMATH Keywords

smoothed analysissuccessive shortest path algorithmminimum-cost flows

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Extremal problems in graph theory (05C35) Distance in graphs (05C12) Paths and cycles (05C38)

Abstract: 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(mnphi)$ for the number of iterations, which implies a smoothed running time of $O(mnphi(m+nlogn))$, where $n$ and $m$ denote the number of nodes and edges, respectively, and $phi$ is a measure for the amount of random noise. This shows that worst-case instances for the SSP algorithm are not robust and unlikely to be encountered in practice. Furthermore, we prove a smoothed lower bound of $Omega(mphiminn,phi)$ for the number of iterations of the SSP algorithm, showing that the upper bound cannot be improved for $phi=Omega(n)$.

Recommendations

• Smoothed analysis of the successive shortest path algorithm
• Smoothed analysis of the minimum-mean cycle canceling algorithm and the network simplex algorithm
• Smoothed analysis of the minimum-mean cycle canceling algorithm and the network simplex algorithm
• On dual minimum cost flow algorithms
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm

Cites work

• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
• A bad network problem for the simplex method and other minimum cost flow algorithms
• A strongly polynomial minimum cost circulation algorithm
• An Out-of-Kilter Method for Minimal-Cost Flow Problems
• Beyond Hirsch Conjecture: Walks on Random Polytopes and Smoothed Complexity of the Simplex Method
• Combinatorial optimization. Theory and algorithms.
• Finding Minimum-Cost Circulations by Successive Approximation
• Finding minimum-cost circulations by canceling negative cycles
• Finding short paths on polytopes by the shadow vertex algorithm
• Introduction to algorithms.
• Minimum-cost flow algorithms: an experimental evaluation
• Monotone networks
• Network flows. Theory, algorithms, and applications.
• New Methods in Mathematical Programming—Optimal Flow Through Networks with Gains
• On dual minimum cost flow algorithms
• Random knapsack in expected polynomial time
• Smoothed analysis of algorithms
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Tight bounds on the number of minimum-mean cycle cancellations and related results
• Typical Properties of Winners and Losers [0.2ex] in Discrete Optimization

Cited in

(9)

• Smoothed Analysis on Connected Graphs
• Smoothed Analysis on Connected Graphs
• A friendly smoothed analysis of the simplex method
• Smoothed analysis of the minimum-mean cycle canceling algorithm and the network simplex algorithm
• Fundamentals of Computation Theory
• Smoothed analysis of the minimum-mean cycle canceling algorithm and the network simplex algorithm
• Smoothed analysis of probabilistic roadmaps
• Smoothed analysis of the successive shortest path algorithm
• Smoothed analysis of local search algorithms

This page was built for publication: Smoothed analysis of the successive shortest path algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3457194)