Pages that link to "Item:Q685307"
From MaRDI portal
The following pages link to Combinatorial properties and the complexity of a max-cut approximation (Q685307):
Displaying 22 items.
- Computing the Grothendieck constant of some graph classes (Q408441) (← links)
- Max-cut and extendability of matchings in distance-regular graphs (Q518196) (← links)
- A survey of automated conjectures in spectral graph theory (Q962119) (← links)
- On conjectures involving second largest signless Laplacian eigenvalue of graphs (Q967519) (← links)
- Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems (Q992570) (← links)
- The Laplacian spectral radius of a graph under perturbation (Q1005808) (← links)
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621) (← links)
- Laplacian eigenvalues and the maximum cut problem (Q1319025) (← links)
- Semidefinite programming in combinatorial optimization (Q1365053) (← links)
- Null spaces of correlation matrices (Q1399237) (← links)
- Semidefinite programming (Q1600854) (← links)
- A randomized approximation scheme for metric MAX-CUT (Q1604207) (← 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)
- Some geometric results in semidefinite programming (Q1905963) (← links)
- On computational capabilities of Ising machines based on nonlinear oscillators (Q2150420) (← links)
- Diffusion bank networks and capital flows (Q2230764) (← links)
- Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs (Q2369038) (← links)
- On Khot’s unique games conjecture (Q3109809) (← links)
- New bounds for the maximum cut problem (Q3439502) (← links)
- A guide to conic optimisation and its applications (Q4634309) (← links)
