Sciweavers

666 search results - page 3 / 134
» The Pipelined Set Cover Problem
Sort
View
FGCN
2007
IEEE
149views Communications» more  FGCN 2007»
14 years 3 days ago
Cover Set Problem in Directional Sensor Networks
— A directional sensor network consists of a number of directional sensors, which can switch to several directions to extend their sensing ability to cover the interested targets...
Yanli Cai, Wei Lou, Minglu Li
ICALP
2004
Springer
13 years 11 months ago
The Minimum-Entropy Set Cover Problem
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
Eran Halperin, Richard M. Karp
ANTSW
2004
Springer
13 years 11 months ago
A Comparison Between ACO Algorithms for the Set Covering Problem
Abstract. In this paper we present a study of several Ant Colony Optimization (ACO) algorithms for the Set Covering Problem. In our computational study we emphasize the influence ...
Lucas Lessing, Irina Dumitrescu, Thomas Stütz...
STOC
2003
ACM
98views Algorithms» more  STOC 2003»
14 years 6 months ago
The online set cover problem
Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbi...
ESA
2005
Springer
146views Algorithms» more  ESA 2005»
13 years 11 months ago
An Approximation Algorithm for the Minimum Latency Set Cover Problem
The input to the minimum latency set cover problem (MLSC) consists of a set of jobs and a set of tools. Each job j needs a specific subset Sj of the tools in order to be processed...
Refael Hassin, Asaf Levin