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 ...
Management Science, Vol. 37, No. 8 (Aug., 1991), pp. 909-925 (17 pages) This paper is concerned with the general dynamic lot size model, or (generalized) Wagner-Whitin model. Let n denote the number ...
This is a preview. Log in through your library . Abstract Our main contribution is an O(n log n) algorithm that determines with high probability a perfect matching in a random 2-out bipartite graph.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback