Towards Strong Nonapproximability Results in the Lovász-Schrijver Hierarchy. Alekhnovich, M., Arora, S., & Tourlakis, I. Computational Complexity, 20(4):615-648, 2011.
Towards Strong Nonapproximability Results in the Lovász-Schrijver Hierarchy [link]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