255
reputation
1
8

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.

1
answer
4
questions
~5k
people reached
  • Member for 4 years, 4 months
  • 5 profile views
  • Last seen Jan 17 '17 at 21:48

Top tags (5)

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

Top posts (5) All Questions Answers | Votes Newest

Badges (9)

Gold

Silver

1

Rarest

Bronze

8

Rarest