91 search results - page 7 / 19 » Bounding the Size of k-Tuple Covers |
ICALP
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
SWAT
2004
Springer
15 years 3 months ago
2004
Springer
The standard dynamic programming solution to finding k-medians on a line with n nodes requires O(kn2 ) time. Dynamic programming speedup techniques, e.g., use of the quadrangle i...
SIAMDM
1998
14 years 9 months ago
1998
In this paper we present and describe an improved version of the Zero-Neighbors algorithm, which we call the Zero-Coverings algorithm. We also present a method for finding a small...
FCT
2009
Springer
15 years 4 months ago
2009
Springer
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
JCT
2011
14 years 4 months ago
2011
This article is devoted to the study of continuous colorings of the n-element subsets of a Polish space. The homogeneity number hm(c) of an n-coloring c : [X]n → 2 is the least s...