Approximation thresholds for combinatorial optimization problems
Computational Complexity
2008-12-15 v1
Abstract
An NP-hard combinatorial optimization problem is said to have an {\em approximation threshold} if there is some such that the optimal value of can be approximated in polynomial time within a ratio of , and it is NP-hard to approximate it within a ratio better than . We survey some of the known approximation threshold results, and discuss the pattern that emerges from the known results.
Cite
@article{arxiv.cs/0304039,
title = {Approximation thresholds for combinatorial optimization problems},
author = {Uriel Feige},
journal= {arXiv preprint arXiv:cs/0304039},
year = {2008}
}