@INPROCEEDINGS{SachdevaS13, 
author={Sachdeva, Sushant and Saket, Rishi}, 
booktitle={IEEE Conference on Computational Complexity (CCC}, 
title={Optimal Inapproximability for Scheduling Problems via Structural Hardness for Hypergraph Vertex Cover}, 
year={2013}, 
pages={219-229}, 
}

{"_id":{"_str":"534243ba0e946d920a0004a8"},"__v":1,"authorIDs":[],"author_short":["Sachdeva, S.","Saket, R."],"bibbaseid":"sachdeva-saket-optimalinapproximabilityforschedulingproblemsviastructuralhardnessforhypergraphvertexcover-2013","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"propositions":[],"lastnames":["Sachdeva"],"firstnames":["Sushant"],"suffixes":[]},{"propositions":[],"lastnames":["Saket"],"firstnames":["Rishi"],"suffixes":[]}],"booktitle":"IEEE Conference on Computational Complexity (CCC","title":"Optimal Inapproximability for Scheduling Problems via Structural Hardness for Hypergraph Vertex Cover","year":"2013","pages":"219-229","bibtex":"@INPROCEEDINGS{SachdevaS13, \nauthor={Sachdeva, Sushant and Saket, Rishi}, \nbooktitle={IEEE Conference on Computational Complexity (CCC}, \ntitle={Optimal Inapproximability for Scheduling Problems via Structural Hardness for Hypergraph Vertex Cover}, \nyear={2013}, \npages={219-229}, \n}\n\n\n","author_short":["Sachdeva, S.","Saket, R."],"key":"SachdevaS13","id":"SachdevaS13","bibbaseid":"sachdeva-saket-optimalinapproximabilityforschedulingproblemsviastructuralhardnessforhypergraphvertexcover-2013","role":"author","urls":{},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"people.csail.mit.edu/andyd/CCI_refs.bib","downloads":0,"keywords":[],"search_terms":["optimal","inapproximability","scheduling","problems","via","structural","hardness","hypergraph","vertex","cover","sachdeva","saket"],"title":"Optimal Inapproximability for Scheduling Problems via Structural Hardness for Hypergraph Vertex Cover","year":2013,"dataSources":["Te9pFfTBkQvusPFGk","6sSgqzaHAPRWvSxTP"]}