1040 search results - page 92 / 208 » Rounding algorithms for covering problems |
RECOMB
2004
Springer
15 years 10 months ago
2004
Springer
This paper is concerned with the reconstruction of perfect phylogenies from binary character data with missing values, and related problems of inferring complete haplotypes from h...
104
click to vote
MFCS
2009
Springer
15 years 2 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
120
click to vote
ARITH
2011
IEEE
13 years 9 months ago
2011
IEEE
—We consider the problem of short division — i.e., approximate quotient — of multiple-precision integers. We present ready-to-implement algorithms that yield an approximation...
AISADM
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We present CoLe, a model for cooperative agents for mining knowledge from heterogeneous data. CoLe allows for the cooperation of different mining agents and the combinat...
CCGRID
2003
IEEE
15 years 3 months ago
2003
IEEE
Fixed-parameter tractability (FPT) techniques have recently been successful in solving NP-complete problem instances of practical importance which were too large to be solved with...