1272 search results - page 46 / 255 » The Set Cover with Pairs Problem |
91
Voted
WADS
2007
Springer
15 years 6 months ago
2007
Springer
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first layer of the ...
130
Voted
IPCO
2004
15 years 2 months ago
2004
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...
76
Voted
ICDM
2009
IEEE
15 years 7 months ago
2009
IEEE
Sampling-based methods have previously been proposed for the problem of finding interesting associations in data, even for low-support items. While these methods do not guarantee ...
FC
2007
Springer
15 years 7 months ago
2007
Springer
Setting up security associations between end-user devices is a challenging task when it needs to be done by ordinary users. The increasing popularity of powerful personal electroni...
125
Voted
ISCC
2005
IEEE
2005
IEEE
Preserving Area Coverage in Wireless Sensor Networks by Using Surface Coverage Relay Dominating Sets
15 years 6 months ago
— Sensor networks consist of autonomous nodes with limited battery and of base stations with theoritical infinite energy. Nodes can be sleep to extend the lifespan of the networ...