#np-hard

1 articles

01 ·Complexity·★ MEMBER·12 min read Approximation Algorithms — Trading Exactness for a Guarantee The craft of giving up on the optimal answer while attaching a price tag that reads "never worse than X times optimal". We build up the approximation ratio, carry a greedy proof all the way to the end, and see why the triangle inequality flips the entire conclusion for the traveling salesman problem.