On the Hardness of Approximating Minimization Problems.

Carsten Lund, Mihalis Yannakakis: On the Hardness of Approximating Minimization Problems. J. ACM 41(5): 960-981(1994)

@article{DBLP:journals/jacm/LundY94,
  author    = {Carsten Lund and
               Mihalis Yannakakis},
  title     = {On the Hardness of Approximating Minimization Problems},
  journal   = {J. ACM},
  volume    = {41},
  number    = {5},
  year      = {1994},
  pages     = {960-981},
  ee        = {db/journals/jacm/LundY94.html, http://doi.acm.org/10.1145/185675.306789},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

BibTeX

Online Edition

Citation Page BibTeX

Referenced by

Howard J. Karloff, Milena Mihail: On the Complexity of the View-Selection Problem. PODS 1999: 167-173

BibTeX