161
reputation
7

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.

0
answers
2
questions
~374
people reached
  • Member for 4 years, 4 months
  • 25 profile views
  • Last seen Jan 7 '17 at 16:54

Top tags (3)

Score 0
Posts 2
Score 0
Posts 1
Score 0
Posts 1

Top posts (2) All Questions Answers | Votes Newest

Badges (7)

Gold

Silver

Bronze

7

Rarest