I am working on an NP-Hard problem. The state-of-the-art algorithm for my problem runs in O(3^n) time using dynamic programming approach. I changed the way the dynamic program works for my problem and it reduces the time complexity to O(n2^n). But, the main problem with my approach is the optimal result. More than 95% of the time my approach is giving the optimal output. Is there any way to publish my work by showing the results for the different data set. I am unable to prove the approximation ratio. Please give me any suggestion regarding this. Note: The Input size is 2^n
Ways to publish new result for NP-complete problem
algorithms;np complete