Following McNeil and Nešlehová (2009), we present some weaker conditions under which a partially nested Archimedean copula with arbitrary nesting levels is still a copula. Relaxing the conditions on the generators enable researchers to model data sets more efficiently.

Given a set of n colored points in the plane, we consider the problem of partitioning the underlying space of the points into monochromatic regions using the minimum number of lines. This is a generalized version of the problem of separating non-colored points by lines studied by Har-Peled and...

We study a natural generalization of the maximum weight many-to-one matching problem. We are given an undirected bipartite graph G = (A P, E) with weights on the edges in E, and with lower and upper quotas on the vertices in P.We seek a maximum weight many-to-one matching satisfying two sets of...