138
reputation
1
13
1-approximation
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.
2
answers
9
questions
~2k
people reached
-
Member for 3 years, 5 months
-
20 profile views
-
Last seen Jan 17 '17 at 21:46
