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 8 years ago
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.

Badges
This user doesn’t have any gold badges yet.
This user doesn’t have any silver badges yet.
4
bronze badges
Top tags
0
Score
1
Posts
100
Posts %
0
Score
1
Posts
100
Posts %
Top posts
question
4
Dec 9, 2015