5 citations · 6 across the 2 of their papers we have counts for
2 papers
cs.CC2015★ 1 cited
Transforming NP to P: An Approach to Solve NP Complete Problems
Wenhong Tian, GuoZhong Li, Xinyang Wang +2
NP complete problem is one of the most challenging issues. The question of whether all problems in NP are also in P is generally considered one of the most important open questions…
cs.DS2015★ 5 cited
Obtaining Quality-Proved Near Optimal Results for Traveling Salesman Problem
Wenhong Tian, Chaojie Huang, Xinyang Wang +1
The traveling salesman problem (TSP) is one of the most challenging NP-hard problems. It has widely applications in various disciplines such as physics, biology, computer science a…