Improved Analysis of a Max Cut Algorithm Based on Spectral Partitioning - Computer Science > Data Structures and AlgorithmsReport as inadecuate




Improved Analysis of a Max Cut Algorithm Based on Spectral Partitioning - Computer Science > Data Structures and Algorithms - Download this document for free, or read online. Document in PDF available to download.

Abstract: Trevisan SICOMP 2012 presented an algorithm for Max-Cut based on spectralpartitioning techniques. This is the first algorithm for Max-Cut with anapproximation guarantee strictly larger than 1-2 that is not based onsemidefinite programming. Trevisan showed that its approximation ratio is of atleast 0.531. In this paper we improve this bound up to 0.614247. We also defineand extend this result for the more general Maximum Colored Cut problem.



Author: José Soto

Source: https://arxiv.org/







Related documents