Sciweavers

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

83

Voted

SODA
2001
ACM

favoriteEmaildiscussreport

108views Algorithms» more SODA 2001»

Approximating coloring and maximum independent sets in 3-uniform hypergraphs

14 years 11 months ago

Approximating coloring and maximum independent sets in 3-uniform hypergraphs

Download www.math.ucla.edu

Michael Krivelevich, Ram Nathaniel, Benny Sudakov

Real-time Traffic

Algorithms | SODA 2001 |

claim paper

Related Content

» Improved Approximation Guarantees through Higher Levels of SDP Hierarchies

» SDPBased Algorithms for Maximum Independent Set Problems on Hypergraphs

» Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs

» Approximation algorithms for finding and partitioning unitdisk graphs into cokplexes

» On Complexity of Optimized Crossover for Binary Representations

» The Complexity of Approximating BoundedDegree Boolean CSP

» Approximating NodeConnectivity Augmentation Problems

» Optimization problems in multiple subtree graphs

» RentorBuy Scheduling and Cost Coloring Problems

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2001
Where	SODA
Authors	Michael Krivelevich, Ram Nathaniel, Benny Sudakov

Comments (0)