201 search results - page 2 / 41 » The Minimum Substring Cover Problem |
JCO
2010
13 years 4 months ago
2010
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
ICGI
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. The computation of the probability of string generation according to stochastic grammars given only some of the symbols that compose it underlies pattern recognition prob...
ICALP
2004
Springer
13 years 11 months ago
2004
Springer
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
DAM
2008
13 years 5 months ago
2008
The paper studies crown reductions for the Minimum Weighted Vertex Cover problem introduced recently in the unweighted case by Fellows et al. [Blow-Ups, Win/Win's and crown r...
ESA
2005
Springer
13 years 11 months ago
2005
Springer
The input to the minimum latency set cover problem (MLSC) consists of a set of jobs and a set of tools. Each job j needs a specific subset Sj of the tools in order to be processed...