Optimal inapproximability for scheduling problems via structural hardness for hypergraph vertex cover
- Sushant Sachdeva
- Rishi Saket
- 2013
- CCC 2013
This is our catalog of publications authored by IBM researchers, in collaboration with the global research community. We’re currently adding our back catalog of more than 110,000 publications. It’s an ever-growing body of work that shows why IBM is one of the most important contributors to modern computing.