Inapproximability of Combinatorial Optimization Problems

Details Inapproximability of Combinatorial Optimization Problems Inapproximability of Combinatorial Optimization Problems

2004-09-24

arxiv.org/abs/cs/0409043v1

Computer Science

Computational Complexity

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Inapproximability of 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 Inapproximability of Combinatorial Optimization Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Inapproximability of Combinatorial Optimization Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-695008