This article is cited in 1 scientific paper (total in 1 paper)
On Stable Instances of MINCUT
I. V. Kozlov
Moscow Institute of Physics and Technology, Institutskiy pereulok, 9, Dolgoprudny, Moscow region, 141700, Russia
A combinatorial optimization problem is called stable if its solution is preserved under perturbation of the input parameters that do not exceed a certain threshold — the stability radius. In [1–3] exact polynomial algorithms have been built for some NP-hard problems on cuts in the assumption of the entrance stability. In this paper we show how to accelerate some algorithms for sufficiently stable polynomial problems. The approach is illustrated by the well-known problem of the minimum cut (MINCUT). We built an $ O(n^2)$ exact algorithm for solving $n$-stable instance of the MINCUT problem. Moreover, we present a polynomial algorithm for calculating the stability radius and a simple criterion for checking $n$-stability of the MINCUT problem.
PDF file (434 kB)
I. V. Kozlov, “On Stable Instances of MINCUT”, Model. Anal. Inform. Sist., 21:4 (2014), 54–63
Citation in format AMSBIB
\paper On Stable Instances of MINCUT
\jour Model. Anal. Inform. Sist.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
K. G. Kuzmin, “A united approach to finding the stability radii in a multicriteria problem of a maximum cut”, J. Appl. Industr. Math., 9:4 (2015), 527–539
|Number of views:|