Optimal inapproximability for scheduling problems via structural hardness for hypergraph vertex cover
- Sushant Sachdeva
- Rishi Saket
- 2013
- CCC 2013
Publications
This is our catalog of publications authored by IBM researchers, in collaboration with the global research community. It’s an ever-growing body of work that shows why IBM is one of the most important contributors to modern computing.
Date
Featured collections
Popular topics
2 results for Sushant Sachdeva
Inapproximability of minimum vertex cover on k-uniform k-partite hypergraphs
- Venkatesan Guruswami
- Sushant Sachdeva
- et al.
- 2015
- SIAM Journal on Discrete Mathematics