Sciweavers

578 search results - page 1 / 116
» The Minimum-Entropy Set Cover Problem
Sort
View
ICALP
2004
Springer
13 years 10 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
APPROX
2006
Springer
130views Algorithms» more  APPROX 2006»
13 years 8 months ago
Tight Results on Minimum Entropy Set Cover
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
Jean Cardinal, Samuel Fiorini, Gwenaël Joret
DCC
2005
IEEE
14 years 4 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...
SIAMCOMP
1998
137views more  SIAMCOMP 1998»
13 years 4 months ago
Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
Sridhar Rajagopalan, Vijay V. Vazirani
MP
2010
79views more  MP 2010»
13 years 2 months ago
MIP reformulations of the probabilistic set covering problem
Anureet Saxena, Vineet Goyal, Miguel A. Lejeune