Optimal inapproximability for scheduling problems via structural hardness for hypergraph vertex cover
- Sushant Sachdeva
- Rishi Saket
- 2013
- CCC 2013
Conference paper
Publications
13 results for Rishi Saket
Hardness of finding independent sets in almost q-colorable graphs
- Subhash Khot
- Rishi Saket
- 2012
- FOCS 2012
Conference paperIntegrality gaps for sparsest cut and minimum linear arrangement problems
- Nikhil R. Devanur
- Subhash A. Khot
- et al.
- 2006
- STOC 2006
Conference paper