English

Inapproximability of Combinatorial Optimization Problems

Computational Complexity 2007-05-23 v1

Abstract

We survey results on the hardness of approximating combinatorial optimization problems.

Keywords

Cite

@article{arxiv.cs/0409043,
  title  = {Inapproximability of Combinatorial Optimization Problems},
  author = {Luca Trevisan},
  journal= {arXiv preprint arXiv:cs/0409043},
  year   = {2007}
}