Inapproximability of Combinatorial Optimization Problems

Luca Trevisan. Inapproximability of Combinatorial Optimization Problems. Electronic Colloquium on Computational Complexity (ECCC), (065), 2004. [doi]

@article{ECCC-TR04-065,
  title = {Inapproximability of Combinatorial Optimization Problems},
  author = {Luca Trevisan},
  year = {2004},
  url = {http://eccc.hpi-web.de/eccc-reports/2004/TR04-065/index.html},
  tags = {optimization},
  researchr = {https://researchr.org/publication/ECCC-TR04-065},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  number = {065},
}