@inproceedings{SS11,
  author = {Sachdeva, Sushant and Saket, Rishi},
  booktitle = {APPROX-RANDOM},
  pages = {327-338},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs},
  url = {http://dblp.uni-trier.de/db/conf/approx/approx2011.html#SachdevaS11},
  volume = 6845,
  year = 2011
}

{"_id":{"_str":"534243b90e946d920a00046f"},"__v":1,"authorIDs":[],"author_short":["Sachdeva, S.","Saket, R."],"bibbaseid":"sachdeva-saket-nearlyoptimalnphardnessofvertexcoveronkuniformkpartitehypergraphs-2011","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"propositions":[],"lastnames":["Sachdeva"],"firstnames":["Sushant"],"suffixes":[]},{"propositions":[],"lastnames":["Saket"],"firstnames":["Rishi"],"suffixes":[]}],"booktitle":"APPROX-RANDOM","pages":"327-338","publisher":"Springer","series":"Lecture Notes in Computer Science","title":"Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs","url":"http://dblp.uni-trier.de/db/conf/approx/approx2011.html#SachdevaS11","volume":"6845","year":"2011","bibtex":"@inproceedings{SS11,\n author = {Sachdeva, Sushant and Saket, Rishi},\n booktitle = {APPROX-RANDOM},\n pages = {327-338},\n publisher = {Springer},\n series = {Lecture Notes in Computer Science},\n title = {Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs},\n url = {http://dblp.uni-trier.de/db/conf/approx/approx2011.html#SachdevaS11},\n volume = 6845,\n year = 2011\n}\n\n\n","author_short":["Sachdeva, S.","Saket, R."],"key":"SS11","id":"SS11","bibbaseid":"sachdeva-saket-nearlyoptimalnphardnessofvertexcoveronkuniformkpartitehypergraphs-2011","role":"author","urls":{"Paper":"http://dblp.uni-trier.de/db/conf/approx/approx2011.html#SachdevaS11"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"people.csail.mit.edu/andyd/CCI_refs.bib","downloads":0,"keywords":[],"search_terms":["nearly","optimal","hardness","vertex","cover","uniform","partite","hypergraphs","sachdeva","saket"],"title":"Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs","year":2011,"dataSources":["Te9pFfTBkQvusPFGk","6sSgqzaHAPRWvSxTP"]}