1-approximation's user avatar
1-approximation's user avatar
1-approximation's user avatar
1-approximation
  • Member for 8 years, 3 months
  • Last seen more than 7 years ago
Stats
338
reputation
5k
reached
2
answers
9
questions
Loading…
About

Rule: I always upvote


Theorem:

Given a problem Prob and an algorithm Algo that solves Prob. If Algo is a 1-approximation algorithm then Algo gives the optimal solution for Prob.

If Prob is an NP-hard problem and Algo is a polynomial-time algorithm, then P=NP.

Proof: The proof is omitted due to space limitation.

This user doesn’t have any gold badges yet.
2
silver badges
13
bronze badges
3
Score
6
Posts
55
Posts %
3
Score
4
Posts
36
Posts %
3
Score
4
Posts
36
Posts %
0
Score
3
Posts
27
Posts %
0
Score
2
Posts
18
Posts %
0
Score
2
Posts
18
Posts %
Top posts
View all questions and answers