With a series of new challenges arising, hard optimization problems are more likely encountered in various applications. It is very difficult to obtain favorable outcomes by using the existing methods ...

There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...