201 search results - page 26 / 41 » The Minimum Substring Cover Problem |
117
click to vote
EC
2008
14 years 11 months ago
2008
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
106
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, an...
SECON
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract—In contrast to existing work on the connected coverage problem in wireless sensor networks which assumes omnidirectional sensors with disk-like sensing range, this paper...
113
click to vote
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
AINA
2006
IEEE
15 years 5 months ago
2006
IEEE
In this paper we present Clustering Protocol (CP) for sensor networks. Clustering techniques are used by different protocols and applications to increase scalability and reduce de...