This is a preview of subscription content, log in via an institution to check access.
References
C. Berge, Graph Theory and Its Application [Russian translation], Nauka, Moscow (1969).
Yu. E. Nesterov and A. S. Nemirovskii, Self-Consistent Functions and Polynomial-Time Algorithms in Convex Programming [in Russian], TsEMI AN SSSR, Moscow (1989).
B. N. Pshenichnyi, Linearization Method [in Russian], Nauka, Moscow (1983).
N. Z. Shor and A. S. Davydov, “Bounding method in quadratic extremal problems with 0–1 variables”, Kibernetika, No. 2, 48–50 (1987).
N. Z. Shor and S. I. Stetsenko, Quadratic Extremal Problems and Nondifferentiable Optimization [in Russian], Naukova Dumka, Kiev (1989).
F. Barahona, “The max-cut problem on graphs not contractible toK 5”, Report No. 82239-OR, Institut fur Oekonometrie und Operation Research Bonn (1982).
R. B. Boppana, “Eigenvalues and graph bisection: an average case analysis”, Proc. 28th IEEE Annual Symp. on Foundations of Computer Science (1987), pp. 16–21.
S. Boyd, L. Ghaoui, E. Feron, and V. Balakrishnan, Linear Matrix Inequalities in System and Control Theory, final draft (1994).
F. Cullum, W. Donath, and P. Wolfe, “The minimization of certain nondifferentiable sums of eigenvalue problems”, Math. Progr. Study, No. 3, 35–55 (1975).
C. Delorne and S. Poljak, “Laplacian eigenvalues and the maximum cut problem”, Math. Progr., No. 62, 557–574 (1993).
M. X. Goemans and D. P. Williamson, “Improved approximation algorithm for maximum cut and satisfiability problems using semidefinite programming”, J. ACM (1994).
M. Grotschel, L. Lovasz, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer, Berlin (1968).
M. Grotschel and G. Nemhauser, “A polynomial algorithm for the max-cut problem on graphs without long odd cycles”, Report No. 8221-OR, Institut fur Oekonometrie und Operation Research, Bonn (1982).
M. Grotschel and W. Pulleyblank, “Weakly bipartite graphs and maximum cut problem”, Op. Res. Lett., No. 1, 23–27 (1991).
F. O. Hadlock, “Finding a maximum cut of a planar graph in polynomial time”, SIAM J. Comput., No. 4, 221–225 (1992).
A. V. Karzanov, “Determining the maximal flow in network with the method of preflows”, Soviet Math. Dokl. (1974), pp. 434–437.
F. S. Provan and V. D. Kulkarni, “Exact cuts in networks”, Networks, No. 19, 281–289 (1989).
N. Z. Shor and S. I. Stecenko, “Quadratic Boolean problems and Lovasz bounds”, Abstracts 12th IFIP Conf. on System Modeling and Optimization, Budapest (1985), pp. 302–304.
K. Wagner, “Beweis einer Abschwachung der Hadwiger-Vermutung”, Math. Ann., No. 153, 139–141 (1964).
K. Wagner, Graphentheorie, Hochschultaschenbucher-Verlag (1970).
M. Yannakakis, “Node-and-edge deletionNP-complete problems”, Proc. 10th Ann. ACM Symp. on Theory of Computing, ACM, New York (1978), pp. 253–264.
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 100–106, March–April, 1995.
Rights and permissions
About this article
Cite this article
Shor, N.Z., Berezovskii, O.A. New algorithms for the weighted maximum cut problem on graphs. Cybern Syst Anal 31, 240–245 (1995). https://doi.org/10.1007/BF02366923
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02366923