Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

CORR
2010
Springer

favoriteEmaildiscussreport

155views Education» more CORR 2010»

Combinatorial Approximation Algorithms for MaxCut using Random Walks

13 years 4 months ago

Combinatorial Approximation Algorithms for MaxCut using Random Walks

Download www.cs.princeton.edu

: 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

Satyen Kale, C. Seshadhri

Real-time Traffic

Combinatorial Approximation Algorithm | CORR 2010 | Education | Main Partitioning Procedure | Trivial 0.5 Factor |

claim paper

Related Content

» Combinatorial 56approximation of Max Cut in graphs of maximum degree 3

» Improved Approximation of MAXCUT on Graphs of Bounded Degree

» Integrality gaps for SheraliAdams relaxations

» Sampling Subproblems of Heterogeneous Maxcut Problems and Approximation Algorithms

» A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies

» Faster Generation of Random Spanning Trees

» A hierarchical floating random walk algorithm for fabricaware 3D capacitance extraction

» Random Walk Inference and Learning in A Large Scale Knowledge Base

» Random Walks for Image Segmentation

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2010
Where	CORR
Authors	Satyen Kale, C. Seshadhri

Comments (0)