Approximating coloring and maximum independent sets in 3-uniform hypergraphs

Michael Krivelevich*, Ram Nathaniel, Benny Sudakov

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Original languageEnglish
Title of host publicationProceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms
Pages327-328
Number of pages2
StatePublished - 2001
Event2001 Operating Section Proceedings, American Gas Association - Dallas, TX, United States
Duration: 30 Apr 20011 May 2001

Publication series

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Conference

Conference2001 Operating Section Proceedings, American Gas Association
Country/TerritoryUnited States
CityDallas, TX
Period30/04/011/05/01

Funding

FundersFunder number
National Science FoundationCCR-9987845, DMS-0106589
State of New Jersey Department of State

    Keywords

    • Algorithms
    • Theory
    • Verification

    Cite this