Improved Analysis of a Max-Cut Algorithm Based on Spectral Partitioning
From MaRDI portal
Recommendations
- A spectral partitioning algorithm for maximum directed cut problem
- A spectral partitioning algorithm for maximum directed cut problem
- On the Optimality of the Median Cut Spectral Bisection Graph Partitioning Method
- Spectral bounds for the maximum cut problem
- Improved Cheeger's inequality, analysis of spectral partitioning algorithms through higher order spectral gap
- A class of spectral bounds for max \(k\)-cut
- Improved approximation algorithms for MAX k-CUT and MAX BISECTION
- Improved approximation algorithms for MAX k-cut and MAX BISECTION
- Improved approximation algorithms for maximum graph partitioning problems
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
Cited in
(12)- Simple approximation algorithms for balanced MAX~2SAT
- On computational capabilities of Ising machines based on nonlinear oscillators
- Sharp spectral bounds of several graph parameters using eigenvector norms
- Max cut and the smallest eigenvalue
- Max CUT and the smallest eigenvalue
- A spectral partitioning algorithm for maximum directed cut problem
- A spectral partitioning algorithm for maximum directed cut problem
- An experimental evaluation of semidefinite programming and spectral algorithms for max cut
- Fully dynamic sequential and distributed algorithms for MAX-CUT
- Dual Cheeger constants, signless 1-Laplacians and maxcut
- Comparison of hyperplane rounding for max-cut and quantum approximate optimization algorithm over certain regular graph families
- Triangles improve 0.878 approximation for Maxcut
This page was built for publication: Improved Analysis of a Max-Cut Algorithm Based on Spectral Partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3453578)
