201 search results - page 9 / 41 » The Minimum Substring Cover Problem |
SODA
2004
ACM
13 years 8 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
WDAG
2009
Springer
14 years 2 months ago
2009
Springer
We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (∆ + 1)2 synchronous communication rounds,...
FCT
2009
Springer
14 years 2 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...
JDA
2008
13 years 7 months ago
2008
Set Cover problems are of core importance in many applications. In recent research, the "red-blue variants" where blue elements all need to be covered whereas red elemen...
FSTTCS
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects th...