201 search results - page 29 / 41 » The Minimum Substring Cover Problem |
111
click to vote
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
— In this paper, we study the angle coverage problem in visual sensor networks where all sensors are equipped with cameras. An object of interest moves around the network and the...
103
click to vote
RECOMB
2005
Springer
16 years 2 days ago
2005
Springer
Recombination is an important evolutionary mechanism responsible for the genetic diversity in humans and other organisms. Recently, there has been extensive research on understandi...
ICCAD
2006
IEEE
15 years 8 months ago
2006
IEEE
We present a gridless method for solving the interior problem for a set of conductors in an homogeneous dielectric, at sufficiently high frequencies, valid for conductor lengths ...