15 search results - page 2 / 3 » jco 2008 |
JCO
2008
13 years 4 months ago
2008
JCO
2008
13 years 4 months ago
2008
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.
JCO
2008
13 years 4 months ago
2008
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...
JCO
2008
13 years 4 months ago
2008
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 ...
JCO
2008
13 years 4 months ago
2008
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...