Eigenvalues in Combinatorial Optimization

In the last decade many important applications of eigenvalues and eigenvectors of graphs in combinatorial optimization were discovered. The number and importance of these results is so fascinating that it makes sense to present this survey.

[1]  F. H. Jackson.  q-Difference Equations , 1910 .

[2]  K. Fan.  On a Theorem of Weyl Concerning Eigenvalues of Linear Transformations I. , 1949, Proceedings of the National Academy of Sciences of the United States of America.

[3]  K. Fan.  On a Theorem of Weyl Concerning Eigenvalues of Linear Transformations: II. , 1949, Proceedings of the National Academy of Sciences of the United States of America.

[4]  A. Hoffman,et al.  The variation of the spectrum of a normal matrix , 1953 .

[5]  E. Wigner.  Characteristic Vectors of Bordered Matrices with Infinite Dimensions I , 1955 .

[6]  John G. Kemeny,et al.  Finite Markov Chains. , 1960 .

[7]  B. Gelbaum,et al.  Problems in analysis , 1964 .

[8]  M. Murty.  Ramanujan Graphs , 1965 .

[9]  T. Motzkin,et al.  Maxima for Graphs and a New Proof of a Theorem of Turán , 1965, Canadian Journal of Mathematics.

[10]  H. Wilf.  The Eigenvalues of a Graph and Its Chromatic Number , 1967 .

[11]  J. Cheeger.  A lower bound for the smallest eigenvalue of the Laplacian , 1969 .

[12]  Peter Lancaster,et al.  The theory of matrices , 1969 .

[13]  R C Durfee,et al.  A METHOD OF CLUSTER ANALYSIS. , 1970, Multivariate behavioral research.

[14]  A. J. Hoffman,et al.  ON EIGENVALUES AND COLORINGS OF GRAPHS, II , 1970 .

[15]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[16]  Richard M. Karp,et al.  Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

[17]  R. P. Kurshan,et al.  On the addressing problem of loop switching , 1972 .

[18]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[19]  D. Djoković.  Distance-preserving subgraphs of hypercubes , 1973 .

[20]  A. Hoffman,et al.  Lower bounds for the partitioning of graphs , 1973 .

[21]  Alex Pothen,et al.  PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .

[22]  David S. Johnson,et al.  Some simplified NP-complete problems , 1974, STOC '74.

[23]  Åke Björck,et al.  Numerical Methods , 2021, Markov Renewal and Piecewise Deterministic Processes.

[24]  P. Wolfe,et al.  The minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices , 1975 .

[25]  M. Fiedler.  A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory , 1975 .

[26]  T. L. Saaty.  A Scaling Method for Priorities in Hierarchical Structures , 1977 .

[27]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[28]  R. Osserman.  The isoperimetric inequality , 1978 .

[29]  László Lovász,et al.  On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[30]  L. Lovász.  Combinatorial problems and exercises , 1979 .

[31]  Richard J. Lipton,et al.  Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[32]  P. D. Straffing.  LINEAR ALGEBRA IN GEOGRAPHY, EIGENVECTORS OF NETWORKS , 1980 .

[33]  Michael Doob,et al.  Spectra of graphs , 1980 .

[34]  B. McKay.  The expected eigenvalue distribution of a large regular graph , 1981 .

[35]  János Komlós,et al.  The eigenvalues of random symmetric matrices , 1981, Comb..

[36]  V. Sós,et al.  Algebraic methods in graph theory , 1981 .

[37]  E. Barnes.  An algorithm for partitioning the nodes of a graph , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[38]  F. Juhász.  On the spectrum of a random graph , 1981 .

[39]  Ferenc Juhász,et al.  The asymptotic behaviour of lovász’ ϑ function for random graphs , 1982, Comb..

[40]  P. Flajolet.  On approximate counting , 1982 .

[41]  Ferenc Juhász,et al.  On the asymptotic behaviour of the spectra of non-symmetric random (0, 1) matrices , 1982, Discret. Math..

[42]  Norman E. Gibbs,et al.  The bandwidth problem for graphs and matrices - a survey , 1982, J. Graph Theory.

[43]  Peter Winkler,et al.  Proof of the squashed cube conjecture , 1983, Comb..

[44]  J. Gilbert,et al.  Graph Coloring Using Eigenvalue Decomposition , 1983 .

[45]  D. Aldous.  On the time taken by random walks on finite groups to visit every state , 1983 .

[46]  Gene H. Golub,et al.  Matrix computations , 1983 .

[47]  M. Gromov,et al.  A topological application of the isoperimetric inequality , 1983 .

[48]  C. Moler,et al.  Singular Value Analysis of Cryptograms , 1983 .

[49]  J. A. Bondy,et al.  Progress in Graph Theory , 1984 .

[50]  J. Dodziuk.  Difference equations, isoperimetric inequality and transience of certain random walks , 1984 .

[51]  R. Burkard.  Quadratic Assignment Problems , 1984 .

[52]  R. Graham,et al.  Isometric embeddings of graphs. , 1984, Proceedings of the National Academy of Sciences of the United States of America.

[53]  A. Hoffman,et al.  Partitioning, Spectra and Linear Programming , 1984 .

[54]  R. M. Tanner.  Explicit Concentrators from Generalized N-Gons , 1984 .

[55]  Peter Buser,et al.  On the bipartition of graphs , 1984, Discret. Appl. Math..

[56]  W. Pulleyblank.  Progress in combinatorial optimization , 1985 .

[57]  A. Hoffman,et al.  On Transportation Problems with Upper Bounds on Leading Rectangles , 1985 .

[58]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[59]  J. Cullum,et al.  Lanczos algorithms for large symmetric eigenvalue computations , 1985 .

[60]  Earl R. Barnes.  Partitioning the nodes of a graph , 1985 .

[61]  N. Varopoulos.  Isoperimetric inequalities and Markov chains , 1985 .

[62]  L. Beineke,et al.  Selected Topics in Graph Theory 2 , 1985 .

[63]  T. D. Morley,et al.  Eigenvalues of the Laplacian of a graph , 1985 .

[64]  Noga Alon,et al.  lambda1, Isoperimetric inequalities for graphs, and superconcentrators , 1985, J. Comb. Theory, Ser. B.

[65]  Peter Winkler,et al.  Collapse of the Metric Hierarchy for Bipartite Graphs , 1986, Eur. J. Comb..

[66]  N. Alon.  Eigenvalues and expanders , 1986, Comb..

[67]  Robert Brooks,et al.  Combinatorial problems in spectral geometry , 1986 .

[68]  Herbert S. Wilf,et al.  Spectral bounds for the clique and independence numbers of graphs , 1986, J. Comb. Theory, Ser. B.

[69]  Toshikazu Sunada,et al.  Curvature and Topology of Riemannian Manifolds , 1986 .

[70]  Ali Ridha Mahjoub,et al.  On the cut polytope , 1986, Math. Program..

[71]  Ravi B. Boppana,et al.  Eigenvalues and graph bisection: An average-case analysis , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[72]  Mark Jerrum,et al.  Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains , 1987, WG.

[73]  Andrei Z. Broder,et al.  On the second eigenvalue of random regular graphs , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[74]  D. L. Powers.  Graph Partitioning by Eigenvectors , 1988 .

[75]  J. Zowe,et al.  A combination of the bundle approach and the trust region concept , 1988 .

[76]  Bojan Mohar,et al.  Walk generating functions and spectral measures of infinite graphs , 1988 .

[77]  M. Overton.  On minimizing the maximum eigenvalue of a symmetric matrix , 1988 .

[78]  B. Mohar.  Isoperimetric inequalities, growth, and the spectrum of graphs , 1988 .

[79]  F. Bien.  Constructions of telephone networks by group representations , 1989 .

[80]  Mark Jerrum,et al.  Approximating the Permanent , 1989, SIAM J. Comput..

[81]  Martin E. Dyer,et al.  A random polynomial-time algorithm for approximating the volume of convex bodies , 1991, JACM.

[82]  Endre Szemerédi,et al.  On the second eigenvalue of random regular graphs , 1989, STOC '89.

[83]  Bojan Mohar,et al.  Isoperimetric numbers of graphs , 1989, J. Comb. Theory, Ser. B.

[84]  Russell Merris,et al.  An edge version of the matrix-tree theorem and the wiener index , 1989 .

[85]  M. Fiedler.  Laplacian of graphs and algebraic connectivity , 1989 .

[86]  Martin E. Dyer,et al.  A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies , 1989, STOC.

[87]  Anna R. Karlin,et al.  Bounds on the cover time , 1989 .

[88]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[89]  F. Chung.  Diameters and eigenvalues , 1989 .

[90]  F. Juhász.  On the theoretical backgrounds of cluster analysis based on the eigenvalue problem of the association matrix , 1989 .

[91]  David J. Aldous,et al.  Lower bounds for covering times for reversible Markov chains and random walks on graphs , 1989 .

[92]  D. Aldous.  Hitting times for random walks on vertex-transitive graphs , 1989, Mathematical Proceedings of the Cambridge Philosophical Society.

[93]  Franz Rendl,et al.  Bounds for the Quadratic Assignment Problems Using Continuous Optimization Techniques , 1990, IPCO.

[94]  Miklós Simonovits,et al.  The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[95]  B. Mohar,et al.  Eigenvalues and the max-cut problem , 1990 .

[96]  J. Palacios.  On a Result of Aleliunas et al. Concerning Random Walks on Graphs , 1990 .

[97]  Peter Winkler,et al.  Maximum itting Time for Random Walks on Graphs , 1990, Random Struct. Algorithms.

[98]  Russell Merris,et al.  The distance spectrum of a tree , 1990, J. Graph Theory.

[99]  Ronitt Rubinfeld,et al.  The Cover Time of a Regular Expander is O(n log n) , 1990, Information Processing Letters.

[100]  Thomas Lengauer,et al.  Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.

[101]  J. Palacios.  Bounds on expected hitting times for a random walk on a connected graph , 1990 .

[102]  Bojan Mohar,et al.  Eigenvalues, diameter, and mean distance in graphs , 1991, Graphs Comb..

[103]  Joel Friedman,et al.  On the second eigenvalue and random walks in randomd-regular graphs , 1991, Comb..

[104]  Ferenc Juhász,et al.  The asymptotic behaviour of Fiedler's algebraic connectivity for random graphs , 1991, Discret. Math..

[105]  B. Mohar.  THE LAPLACIAN SPECTRUM OF GRAPHS y , 1991 .

[106]  Noga Alon,et al.  On the second eigenvalue of a graph , 1991, Discret. Math..

[107]  Charles Delorme,et al.  Diameter, Covering Index, Covering Radius and Eigenvalues , 1991, Eur. J. Comb..

[108]  P. Diaconis,et al.  Geometric Bounds for Eigenvalues of Markov Chains , 1991 .

[109]  A. Nilli.  On the second eigenvalue of a graph , 1991 .

[110]  Michael L. Overton,et al.  On the Sum of the Largest Eigenvalues of a Symmetric Matrix , 1992, SIAM J. Matrix Anal. Appl..

[111]  Shmuel Friedland,et al.  Lower bounds for the first eigenvalue of certain M-matrices associated with graphs , 1992 .

[112]  Franz Rendl,et al.  Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem , 1992, Math. Program..

[113]  Franz Rendl,et al.  A New Lower Bound Via Projection for the Quadratic Assignment Problem , 1992, Math. Oper. Res..

[114]  Bojan Mohar,et al.  Optimal linear labelings and eigenvalues of graphs , 1992, Discret. Appl. Math..

[115]  H. Wolkowicz,et al.  Symmetrization of nonsymmetric quadratic assignment problems and the Hoffman-Wielandt inequality , 1992 .

[116]  Bojan Mohar,et al.  Laplace eigenvalues and bandwidth-type invariants of graphs , 1993, J. Graph Theory.

[117]  Charles Delorme,et al.  The performance of an eigenvalue bound on the max-cut problem in some classes of graphs , 1993, Discret. Math..

[118]  Charles Delorme,et al.  Laplacian eigenvalues and the maximum cut problem , 1993, Math. Program..

[119]  Charles Delorme,et al.  Combinatorial Properties and the Complexity of a Max-cut Approximation , 1993, Eur. J. Comb..

[120]  Fan Chung Graham,et al.  An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with its Laplacian , 1994, SIAM J. Discret. Math..

[121]  José Luis Palacios.  Expected Hitting and Cover Times of Random Walks on Some Special Graphs , 1994, Random Struct. Algorithms.

[122]  Alexander Lubotzky,et al.  Discrete groups, expanding graphs and invariant measures , 1994, Progress in mathematics.

[123]  Y. Cho,et al.  Discrete Groups , 1994 .

[124]  Franz Rendl,et al.  A projection technique for partitioning the nodes of a graph , 1995, Ann. Oper. Res..

[125]  Siam J. CoMPtrr,et al.  FINDING A MAXIMUM CUT OF A PLANAR GRAPH IN POLYNOMIAL TIME * , 2022 .