Sciweavers

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

23

STOC
2009
ACM

favoriteEmaildiscussreport

106views Algorithms» more STOC 2009»

Max cut and the smallest eigenvalue

14 years 11 months ago

Max cut and the smallest eigenvalue

Download www.cs.berkeley.edu

We describe a new approximation algorithm for Max Cut. Our algorithm runs in ~O(n2 ) time, where n is the number

Luca Trevisan

Real-time Traffic

Algorithms | STOC 2009 |

claim paper

Related Content

» Finding Folkman Numbers via MAX CUT Problem

» On the Robustness of Complex Networks by Using the Algebraic Connectivity

» Lasserre Hierarchy Higher Eigenvalues and Approximation Schemes for Quadratic Integer Prog...

» Efficiently Solving the Fractional Trust Region Problem

» On Quadratic Programming with a Ratio Objective

» Clustering and Embedding Using Commute Times

Post Info
More Details (n/a)

Added	23 Nov 2009
Updated	23 Nov 2009
Type	Conference
Year	2009
Where	STOC
Authors	Luca Trevisan

Comments (0)