Polynomial time approximation of NPC problem I have found a polynomial time solution of an NPC problem. My algorithm give exact result in most cases. For example if I run my algorithm for 20000 problem instances, then it fails 10 times to give correct result. But, I am unable to prove the approximation ratio mathematically. Is it feasible to show it with the experimental results? I am waiting to hear the possible solutions for it.
Is it feasible to show it with the experimental results?


No, you can not. There is no shortcut around formal proofs here.