4255 search results - page 38 / 851 » Cover |
JACM
1998
13 years 7 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
MP
1998
13 years 7 months ago
1998
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
JMIV
2010
13 years 6 months ago
2010
In this paper we study digital versions of some properties of covering spaces from algebraic topology. We correct and improve upon the presentation of assertions in Han’s papers ...
MFCS
2010
Springer
13 years 6 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
ICAI
2010
13 years 5 months ago
2010
Given a subset of data that differs from the rest, a user often wants an explanation as to why this is the case. For instance, in a database of flights, a user may want to understa...