578 search results - page 26 / 116 » The Minimum-Entropy Set Cover Problem |
TIT
1998
14 years 9 months ago
1998
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...
ICALP
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We suggest a new, unconventional, way for solving the YES/NO version of the Exact Cover problem by using the massive parallelism of light. The idea is to build a device which can ...
WINE
2009
Springer
15 years 4 months ago
2009
Springer
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
SOFSEM
2010
Springer
15 years 6 months ago
2010
Springer
We study Vector Addition Systems with States (VASS) extended in such a way that one of the manipulated integer variables can be tested to zero. For this class of system, it has bee...