The Stack Overflow podcast is back! Listen to an interview with our new CEO.
23
reputation
4

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
1
question
~251
people reached
  • Member for 3 years, 10 months
  • 1 profile view
  • Last seen Jan 1 '16 at 20:35

Top tags (2)

Score 0
Posts 1
Score 0
Posts 1

Top posts (1) All Questions Answers | Votes Newest

Badges (4)

Gold

Silver

Bronze

4

Rarest