Sciweavers

1298 search results - page 28 / 260
» The online set cover problem
Sort
View
ICALP
2010
Springer
14 years 11 months ago
Covering and Packing in Linear Space
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...
Andreas Björklund, Thore Husfeldt, Petteri Ka...
CORR
2007
Springer
96views Education» more  CORR 2007»
14 years 9 months ago
Exact Cover with light
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 ...
Mihai Oltean, Oana Muntean
WINE
2009
Springer
138views Economy» more  WINE 2009»
15 years 4 months ago
Covering Games: Approximation through Non-cooperation
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...
Martin Gairing
SOFSEM
2010
Springer
15 years 6 months ago
Mixing Coverability and Reachability to Analyze VASS with One Zero-Test
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...
Alain Finkel, Arnaud Sangnier
DAM
2006
63views more  DAM 2006»
14 years 9 months ago
A new family of proximity graphs: Class cover catch digraphs
Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs--class cove...
Jason DeVinney, Carey E. Priebe