Towards Strong Nonapproximability Results in the Lovász-Schrijver Hierarchy. Alekhnovich, M., Arora, S., & Tourlakis, I. Computational Complexity, 20(4):615-648, 2011. Link bibtex @article{DBLP:journals/cc/AlekhnovichAT11,
author = {Mikhail Alekhnovich and
Sanjeev Arora and
Iannis Tourlakis},
title = {Towards Strong Nonapproximability Results in the Lov{\'a}sz-Schrijver
Hierarchy},
journal = {Computational Complexity},
volume = {20},
number = {4},
year = {2011},
pages = {615-648},
ee = {http://dx.doi.org/10.1007/s00037-011-0027-z},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Downloads: 0
{"_id":{"_str":"534243ba0e946d920a0004ad"},"__v":1,"authorIDs":[],"author_short":["Alekhnovich, M.","Arora, S.","Tourlakis, I."],"bibbaseid":"alekhnovich-arora-tourlakis-towardsstrongnonapproximabilityresultsinthelovszschrijverhierarchy-2011","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Mikhail"],"propositions":[],"lastnames":["Alekhnovich"],"suffixes":[]},{"firstnames":["Sanjeev"],"propositions":[],"lastnames":["Arora"],"suffixes":[]},{"firstnames":["Iannis"],"propositions":[],"lastnames":["Tourlakis"],"suffixes":[]}],"title":"Towards Strong Nonapproximability Results in the Lovász-Schrijver Hierarchy","journal":"Computational Complexity","volume":"20","number":"4","year":"2011","pages":"615-648","ee":"http://dx.doi.org/10.1007/s00037-011-0027-z","bibsource":"DBLP, http://dblp.uni-trier.de","bibtex":"@article{DBLP:journals/cc/AlekhnovichAT11,\n author = {Mikhail Alekhnovich and\n Sanjeev Arora and\n Iannis Tourlakis},\n title = {Towards Strong Nonapproximability Results in the Lov{\\'a}sz-Schrijver\n Hierarchy},\n journal = {Computational Complexity},\n volume = {20},\n number = {4},\n year = {2011},\n pages = {615-648},\n ee = {http://dx.doi.org/10.1007/s00037-011-0027-z},\n bibsource = {DBLP, http://dblp.uni-trier.de}\n}\n\n\n","author_short":["Alekhnovich, M.","Arora, S.","Tourlakis, I."],"key":"DBLP:journals/cc/AlekhnovichAT11","id":"DBLP:journals/cc/AlekhnovichAT11","bibbaseid":"alekhnovich-arora-tourlakis-towardsstrongnonapproximabilityresultsinthelovszschrijverhierarchy-2011","role":"author","urls":{"Link":"http://dx.doi.org/10.1007/s00037-011-0027-z"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"people.csail.mit.edu/andyd/CCI_refs.bib","downloads":0,"keywords":[],"search_terms":["towards","strong","nonapproximability","results","lov","schrijver","hierarchy","alekhnovich","arora","tourlakis"],"title":"Towards Strong Nonapproximability Results in the Lovász-Schrijver Hierarchy","year":2011,"dataSources":["Te9pFfTBkQvusPFGk","6sSgqzaHAPRWvSxTP"]}