Pages that link to "Item:Q1319025"
From MaRDI portal
The following pages link to Laplacian eigenvalues and the maximum cut problem (Q1319025):
Displaying 50 items.
- Max \(k\)-cut and the smallest eigenvalue (Q286169) (← links)
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach (Q427399) (← links)
- On duality gap in binary quadratic programming (Q454277) (← links)
- On Laplacian spectra of parametric families of closely connected networks with application to cooperative control (Q506453) (← links)
- Max-cut and extendability of matchings in distance-regular graphs (Q518196) (← links)
- Small bipartite subgraph polytopes (Q613319) (← links)
- An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (Q623464) (← links)
- Edge cover by connected bipartite subgraphs (Q646717) (← links)
- Laplace eigenvalues of graphs---a survey (Q686298) (← links)
- The performance of an eigenvalue bound on the max-cut problem in some classes of graphs (Q686456) (← links)
- Cheeger's cut, maxcut and the spectral theory of 1-Laplacian on graphs (Q724411) (← links)
- Using the eigenvalue relaxation for binary least-squares estimation problems (Q839052) (← links)
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
- New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← links)
- New bounds on the unconstrained quadratic integer programming problem (Q925231) (← links)
- A survey of automated conjectures in spectral graph theory (Q962119) (← links)
- Maximum cut in fuzzy nature: models and algorithms (Q964947) (← links)
- Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems (Q992570) (← links)
- The Laplacian spectral radius of a graph under perturbation (Q1005808) (← links)
- Spectral partitioning with multiple eigenvectors (Q1276952) (← links)
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621) (← links)
- Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality (Q1297468) (← links)
- Node and edge relaxations of the max-cut problem (Q1319044) (← links)
- Semidefinite programming in combinatorial optimization (Q1365053) (← links)
- Best ellipsoidal relaxation to solve a nonconvex problem. (Q1421225) (← links)
- Laplacian eigenvalues and fixed size multisection (Q1422418) (← links)
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
- A randomized approximation scheme for metric MAX-CUT (Q1604207) (← links)
- Checking robust nonsingularity is NP-hard (Q1802197) (← links)
- Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT (Q1841891) (← links)
- Applications of cut polyhedra. II (Q1891020) (← links)
- The expected relative error of the polyhedral approximation of the max- cut problem (Q1892101) (← links)
- On a positive semidefinite relaxation of the cut polytope (Q1894508) (← links)
- Solving the max-cut problem using eigenvalues (Q1900149) (← links)
- A projection technique for partitioning the nodes of a graph (Q1904714) (← links)
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming (Q1905964) (← links)
- New algorithms for the weighted maximum cut problem on graphs (Q1907796) (← links)
- Laplacian spectra and spanning trees of threshold graphs (Q1917274) (← links)
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (Q1925791) (← links)
- Elliptic approximations of propositional formulae (Q1961455) (← links)
- Parametric Lagrangian dual for the binary quadratic programming problem (Q2018469) (← links)
- The product of two high-frequency graph Laplacian eigenfunctions is smooth (Q2111909) (← links)
- Discrete dynamical system approaches for Boolean polynomial optimization (Q2161551) (← links)
- Algebraic connectivity and disjoint vertex subsets of graphs (Q2193366) (← links)
- A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring (Q2196300) (← links)
- On graphs with adjacency and signless Laplacian matrices eigenvectors entries in \(\{-1,+1\}\) (Q2229491) (← links)
- Diffusion bank networks and capital flows (Q2230764) (← links)
- Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs (Q2369038) (← links)
- Tighter spectral bounds for the cut size, based on Laplacian eigenvectors (Q2419023) (← links)
- On the gap between the quadratic integer programming problem and its semidefinite relaxation (Q2492705) (← links)