Inapproximability of Combinatorial Optimization Problems

Computer Science – Computational Complexity

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

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

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

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

     

Profile ID: LFWR-SCP-O-695008

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.