We show that any point in the convex hull of each of (d + 1) sets of (d + 1) points in Rd is contained in at least (d + 2)2 /4 simplices with one vertex from each set.
Abstract Group testing, sometimes called pooling design, has been applied to a variety of problems such as blood testing, multiple access communication, coding theory, among others...
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
In this paper we present two main results about the inapproximability of the exemplar conserved interval distance problem of genomes. First, we prove that it is NP-complete to deci...
Zhixiang Chen, Richard H. Fowler, Bin Fu, Binhai Z...