318
reputation
1
1

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.

  • Member for 3 years, 11 months
  • 0 profile views
  • Last seen Mar 1 '16 at 21:07