.879-approximation algorithms for MAX CUT and MAX 2SAT
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Bipartite density of cubic graphs
Discrete Mathematics
A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Binary Partitioning, Perceptual Grouping, and Restoration with Semidefinite Programming
IEEE Transactions on Pattern Analysis and Machine Intelligence
The Laplacian spectral radius of a graph under perturbation
Computers & Mathematics with Applications
An optimal sdp algorithm for max-cut, and equally optimal long code tests
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Max cut and the smallest eigenvalue
Proceedings of the forty-first annual ACM symposium on Theory of computing
Local search starting from an LP solution: Fast and quite good
Journal of Experimental Algorithmics (JEA)
Rounding two and three dimensional solutions of the SDP relaxation of MAX CUT
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
| Hi-index | 0.00 |