"Approximating coloring and maximum independent sets in 3-uniform hypergraphs."

Michael Krivelevich, Ram Nathaniel, Benny Sudakov (2001)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2012-12-07

- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/soda/KrivelevichNS01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/KrivelevichNS01
Michael Krivelevich, Ram Nathaniel, Benny Sudakov:
Approximating coloring and maximum independent sets in 3-uniform hypergraphs. SODA 2001: 327-328

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.