This guy keeps spamming this package here. Polynomial time approximation algorithms for NP complete problems are not a big deal and are pretty well known for different problems. Yes, they’re useful, but I don’t think anyone in theoretical CS views the existence of approximation algorithms as saying anything about P vs NP.