Guest column: the elusive inapproximability of the TSP

@article{Lampis2014GuestCT,
  title={Guest column: the elusive inapproximability of the TSP},
  author={Michael Lampis},
  journal={SIGACT News},
  year={2014},
  volume={45},
  pages={48-65}
}
After two decades of progress in hardness of approximation we finally completely understand the extent to which many optimization problems can be approximated in polynomial time. Unfortunately, however, and despite significant efforts, many important problems continue to resist such an understanding. One example is the famous Traveling Salesman Problem, for which the best currently known hardness of approximation bounds are strongly believed to be quite far from the truth. In this article, we… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 11 REFERENCES

On the complexity of approximating k-set packing

  • computational complexity
  • 2006
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Inapproximability of Combinatorial Optimization Problems

  • Electronic Colloquium on Computational Complexity
  • 2004
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Improved Approximation Lower Bounds on Small Occurrence Optimization

  • Electronic Colloquium on Computational Complexity
  • 2003
VIEW 21 EXCERPTS
HIGHLY INFLUENTIAL

Some Optimal Inapproximability Results

VIEW 9 EXCERPTS
HIGHLY INFLUENTIAL

Vertex cover might be hard to approximate to within 2-epsilon

  • J. Comput. Syst. Sci.
  • 2003
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL