Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
19
click to vote
STOC
2009
ACM
favorite
Email
discuss
report
106
views
Algorithms
»
more
STOC 2009
»
Max cut and the smallest eigenvalue
14 years 9 months ago
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
more »
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)
Researcher Info
Algorithms Study Group
Computer Vision