Combinatorial Approximation Algorithms for MaxCut using Random Walks

: We give the first combinatorial approximation algorithm for MAXCUT that beats the trivial 0.5 factor by a constant. The main partitioning procedure is very intuitive, natural, and easily described. It essentially performs a number of random walks and aggregates the information to provide the partition. We can control the running time to get an

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Satyen Kale, C. Seshadhri
• Keywords: Combinatorial Approximation Algorithm, CORR 2010, Education, Main Partitioning Procedure, Trivial 0.5 Factor