Abstract
We introduce and study an eigenvalue upper boundϕ(G) on the maximum cut mc (G) of a weighted graph. The functionϕ(G) has several interesting properties that resemble the behaviour of mc (G). The following results are presented.
We show thatϕ is subadditive with respect to amalgam, and additive with respect to disjoint sum and 1-sum. We prove thatϕ(G) is never worse that 1.131 mc(G) for a planar, or more generally, a weakly bipartite graph with nonnegative edge weights. We give a dual characterization ofϕ(G), and show thatϕ(G) is computable in polynomial time with an arbitrary precision.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
F. Barahona, “On the complexity of max-cut,” Rapport de Recherche 186, Mathématiques appliquées et Informatique, Université Scientifique et médicale de Grenoble (Grenoble, France, 1980).
F. Barahona, “On some weakly bipartite graphs,”Operations Research Letters 2 (1983) 239–242.
F. Barahona, M. Grötschel, M. Jünger and G. Reinelt, “An application of combinatorial optimization to statistical physics and circuit layout design,”Operations Research 36 (1988) 493–513.
F. Barahona, M. Jünger and G. Reinelt, “Experiments in quadratic 0–1 programming,”Mathematical Programming 44 (1989) 127–137.
E.R. Barnes and A.J. Hoffman, “On transportation problems with upper bounds on leading rectangles,”SIAM Journal on Algebraic Discrete Methods 6 (1985) 487–496.
R. Boppana, “Eigenvalues and graph bisection: an average case analysis,” in:FOCS (1987) pp. 280–285.
C. Delorme and S. Poljak, “The performance of an eigenvalue bound on the max-cut problem in some classes of graphs,”Discrete Mathematics 111 (1993) 145–156.
C. Delorme and S. Poljak, “Combinatorial properties and the complexity of a max-cut approximation,”European Journal of Combinatorics 14 (1993) 313–333.
V.F. Dem'ianov and V.N. Malozev,Introduction to Minimax (Wiley, New York, 1974).
W.E. Donath and A.J. Hofmann, “Lower bounds for the partitioning of graphs,”IBM Journal on Research and Development 17 (1973) 420–425.
M. Fiedler, “Algebraic connectivity of graphs,”Czechoslovak Mathematical Journal 23 (1973) 298–305.
J. Fonlupt, A.R. Mahjoub and J.P. Uhry, “Compositions in the bipartite subgraph polytope,”Discrete Mathematics 105 (1992) 73–91.
M.R. Garey and D.S. Johnson,Computers and Intractability: A guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979).
M. Grötschel, L. Lovász and A. Schrijver,Geometric Algorithms and Combinatorial Optimization, Algorithms and Combinatorics No. 2 (Springer, Berlin, 1988).
M. Grötschel and W.R. Pulleyblank, “Weakly bipartite graphs and the max-cut problem,”Operations Research Letters 1 (1981) 23–27.
F. Juhász, “On the spectrum of a random graph,” in: L. Lovász and V.T. Sós, eds.,Algebraic Methods in Graph Theory, Colloquia Mathematica Societatis János Bolyai No. 25 (North-Holland, Amsterdam, 1982) pp. 313–316.
P. Lancaster,Theory of Matrices (Academic Press, New York, 1969).
B. Mohar and S. Poljak, “Eigenvalues and the max-cut problem,”Czechoslovak Mathematical Journal 40(115) (1990) 343–352.
M.L. Overton, “On minimizing the maximum eigenvalue of a symmetric matrix,”SIAM Journal on Matrix Analysis and Applications 9 (1988) 256–268.
S. Poljak, “Polyhedral and eigenvalue approximations of the max-cut problem,” to appear in:Sets, Graphs and Numbers, Colloquia Mathematica Societatis János Bolyai No. 59 (North-Holland, Amsterdam, 1991).
S. Poljak and F. Rendl, “Solving the max-cut problem using eigenvalues,” Technical Report 91735-OR, Institut für Diskrete Mathematik, Universität Bonn (Bonn, 1991).
S. Poljak and Zs. Tuza, “The expected relative error of the polyhedral approximation of the max-cut problem,” Technical Report 92757, Institut für Diskrete Mathematik, Universität Bonn (Bonn, 1992).
Author information
Authors and Affiliations
Additional information
The research has been partially done when the second author visited LRI in September 1989.
Rights and permissions
About this article
Cite this article
Delorme, C., Poljak, S. Laplacian eigenvalues and the maximum cut problem. Mathematical Programming 62, 557–574 (1993). https://doi.org/10.1007/BF01585184
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01585184