ACM DL

SIGN IN   SIGN UP

 
ACM Home Page ACM Digital Library Home Page

Approximating coloring and maximum independent sets in 3-uniform hypergraphs

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Michael Krivelevich Department of Mathematics, Raymond and Beverly Sackler, Faculty of Exact Sciences, Tel Aviv University, Tel Aviv 69978, Israel
Ram Nathaniel Department of Computer Science, Raymond and Beverly Sackler, Faculty of Exact Sciences, Tel Aviv University, Tel Aviv 69978, Israel
Benny Sudakov Department of Mathematics, Princeton University, Princeton, NJ and Institute for Advanced Study, Princeton, NJ
Published in:
· Proceeding
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©2001
table of contents ISBN:0-89871-490-7
Approximating coloring and maximum independent sets in 3-uniform hypergraphs 2001 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 11
· Citation Count: 5


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder