2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DS2014★ 2 cited
A New Exact Algorithm for Traveling Salesman Problem with Time Complexity Interval (O(n^4), O(n^3*2^n))
Yunpeng Li
Traveling salesman problem is a NP-hard problem. Until now, researchers have not found a polynomial time algorithm for traveling salesman problem. Among the existing algorithms, dy…
cs.DS2014
A New Single-Source Shortest Path Algorithm for Nonnegative Weight Graph
Yunpeng Li
The single-source shortest path problem is a classical problem in the research field of graph algorithm. In this paper, a new single-source shortest path algorithm for nonnegative…