Sciweavers

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

10

FOCS
1994
IEEE

favoriteEmaildiscussreport

132views Theoretical Computer Science» more FOCS 1994»

Approximate Graph Coloring by Semidefinite Programming

13 years 8 months ago

Approximate Graph Coloring by Semidefinite Programming

Download www.hirata.nuee.nagoya-u.ac.jp

David R. Karger, Rajeev Motwani, Madhu Sudan

Real-time Traffic

FOCS 1994 | Theoretical Computer Science |

claim paper

Related Content

» SpaceEfficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs

» Semidefinite programming relaxations for graph coloring and maximal clique problems

» A Comparative Study of Linear and Semidefinite BranchandCut Methods for Solving the Minimu...

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

» A combinatorial primaldual approach to semidefinite programs

» Clique Clustering Yields a PTAS for maxColoring Interval Graphs

» Strong Colorings of Hypergraphs

» On linear and semidefinite programming relaxations for hypergraph matching

» Vertex Cover in Graphs with Locally Few Colors

Post Info
More Details (n/a)

Added	08 Aug 2010
Updated	08 Aug 2010
Type	Conference
Year	1994
Where	FOCS
Authors	David R. Karger, Rajeev Motwani, Madhu Sudan

Comments (0)