We study the problem of computing the k maximum sum subsequences. Given a sequence of real numbers x1, x2, . . . , xn and an integer parameter k, 1 k 1 2 n(n - 1), the problem in...
We prove convergence in distribution for the profile (the number of nodes at each level), normalized by its mean, of random recursive trees when the limit ratio of the level and ...
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
In this paper, we propose an adaptive approach to merging possibilistic knowledge bases that deploys multiple operators instead of a single operator in the merging process. The me...
Guilin Qi, Weiru Liu, David H. Glass, David A. Bel...
: It follows directly from Shelah's structure theory that if T is a classifiable theory, then the isomorphism type of any model of T is determined by the theory of that model ...