Geodesic
On Stable Instances of MINCUT
Modelirovanie i analiz informacionnyh sistem, Tome 21 (2014) no. 4, pp. 54-63.

Voir la notice de l'article provenant de la source Math-Net.Ru

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.
Keywords: stability
Mots-clés : mincut. 
@article{MAIS_2014_21_4_a5,
     author = {I. V. Kozlov},
     title = {On {Stable} {Instances} of {MINCUT}},
     journal = {Modelirovanie i analiz informacionnyh sistem},
     pages = {54--63},
     publisher = {mathdoc},
     volume = {21},
     number = {4},
     year = {2014},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MAIS_2014_21_4_a5/}
}
TY  - JOUR
AU  - I. V. Kozlov
TI  - On Stable Instances of MINCUT
JO  - Modelirovanie i analiz informacionnyh sistem
PY  - 2014
SP  - 54
EP  - 63
VL  - 21
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MAIS_2014_21_4_a5/
LA  - ru
ID  - MAIS_2014_21_4_a5
ER  - 
%0 Journal Article
%A I. V. Kozlov
%T On Stable Instances of MINCUT
%J Modelirovanie i analiz informacionnyh sistem
%D 2014
%P 54-63
%V 21
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MAIS_2014_21_4_a5/
%G ru
%F MAIS_2014_21_4_a5
I. V. Kozlov. On Stable Instances of MINCUT. Modelirovanie i analiz informacionnyh sistem, Tome 21 (2014) no. 4, pp. 54-63. http://geodesic.mathdoc.fr/item/MAIS_2014_21_4_a5/

[1] Y. Bilu, N. Linial, Are stable instances easy?, Innov. in Comp. Sci. (2010), 332–341

[2] N. Linial, “On the practically interesting instances of MAXCUT”, STACS (2013), 526–537 | MR

[3] K. Makarychev, Y. Makarychev, A. Vijayaraghavan, “Bulu-Linial stable instances of max cut and minimum multiway cut”, Proc. of the 25-th ACM-SIAM Symp. on Disc. Alg. (2014), 890–906 | DOI

[4] L. Ford, D. Fulkerson, “Maximal flow through a network”, Canadian Journal of Mathematics, 8 (1956), 399–404 | DOI | MR | Zbl

[5] R. Gomory, T. Hu, “Multi-terminal network flows”, Journal of the Society of Industrial and Applied Mathematics, 1961, Dec., 551–570 | DOI | MR | Zbl

[6] J. Hao, J. Orlin, “A faster algorithm for finding the minimum cut in a directed graph”, Journal of Algorithms, 17:3, Nov. (1994), 424–446 | DOI | MR | Zbl

[7] A. V. Karzanov, E. A. Timofeev, “Efficient algorithm for finding all minimal edge cuts of a nonoriented graph”, Kibernetika, 1986, no. 2, 8–12 | MR | Zbl

[8] V. D. Podderyugin, “An algorithm for finding the edge connectivity of graphs”, Vopr. Kibern., 1973, no. 2, 136

[9] D. Karger, C. Stein, “A new approach to the minimum cut problem”, Journal of the ACM, 43:4, Jul. (1996), 601–640 | DOI | MR | Zbl

[10] M. Stoer, F. Wagner, “A simple min-cut algorithm”, Journal of the ACM, 44:4, Jul. (1997), 585–591 | DOI | MR | Zbl

[11] Leont'ev V. K., “Ustoychivost zadachi kommivoyazhera”, Zhurn. vychisl. matem. i matem. fiz., 5:15 (1975), 1298–1309 (in Russian) | MR

[12] Gordeev E. N., Leont'ev V. K., “Obshchy podkhod k issledovaniyu ustoychivosti resheny v zadachakh diskretnoy optimizatsii”, Zhurn. vychisl. matem. i matem. fiz., 36:1 (1996), 66–72 (in Russian) | MR | Zbl

[13] J. Orlin, “Max flows in $O(nm)$ time, or better”, STOC (2013), 765–774 | Zbl

[14] V. King, S. Rao, R. Tarjan, “A Faster Deterministic Maximum Flow Algorithm”, Journal of Algorithms, 17:3, Nov. (1994), 447–474 | DOI | MR