1-approximation
  • Member for 5 years, 8 months
Stats
338
reputation
3k
reached
2
answers
9
questions
Loading…
About

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.

This user doesn’t have any gold badges yet.
2
silver badges
13
bronze badges

Top tags (9)

Score 3
Posts 6
Posts % 55
Score 3
Posts 4
Score 3
Posts 4
Score 0
Posts 3
Score 0
Posts 2
Score 0
Posts 2

Top posts (11)

View all questions and answers