Approximate common divisor problem and continued fractions

We describe two algorithms for computing common divisors of two integers, when one of these integers is known only approximately. We generalize a known method based on the continued fraction technique. In some cases new algorithms overcome the best known algorithm based on Coppersmith's method: not so accurate approximation is reqiured to compute a divisor.