Approximation thresholds for combinatorial optimization problems

Details Approximation thresholds for combinatorial optimization problems Approximation thresholds for combinatorial optimization problems

2003-04-28

arxiv.org/abs/cs/0304039v1

Proceedings of the ICM, Beijing 2002, vol. 3, 649--658

Computer Science

Computational Complexity

Scientific paper

An NP-hard combinatorial optimization problem $\Pi$ is said to have an {\em approximation threshold} if there is some $t$ such that the optimal value of $\Pi$ can be approximated in polynomial time within a ratio of $t$, and it is NP-hard to approximate it within a ratio better than $t$. We survey some of the known approximation threshold results, and discuss the pattern that emerges from the known results.

Affiliated with

Also associated with

No associations

Rating

Approximation thresholds for combinatorial optimization problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Approximation thresholds for combinatorial optimization problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximation thresholds for combinatorial optimization problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-333834