—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 ...
Mark G. Karpovsky, Krishnendu Chakrabarty, Lev B. ...
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...
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 ...
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...
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...