Results 281 to 290 of about 925,039 (306)
Some of the next articles are maybe not open access.
On Set Covering Based on Biclustering
International Journal of Information Technology & Decision Making, 2014In this paper, we present a clustering heuristic for solving demand covering models where the objective is to determine locations for servers that optimally cover a given set of demand points. This heuristic is based on the concept of biclusters and processes the set of demand points as well as the set of potential servers and determines biclusters ...
Antiopi Panteli +2 more
openaire +2 more sources
Minimal covering sets for infinite set systems
Discrete Mathematics, 2019Given a set \(V\) and a collection \(\mathcal H\) of non-empty subsets of \(V\), \(M \subseteq V\) is a covering set if \(M \cap A \neq \emptyset\) for all \(A \in \mathcal H\). \(M\) is a minimal covering set if \(M\) is a covering set and no proper subset of \(M\) is a covering set.
openaire +2 more sources
Covering Properties of Convex Sets
Bulletin of the London Mathematical Society, 1986Partant d'un recouvrement ouvert de certains convexes d'un espace vectoriel topologique séparé, l'A. obtient un recouvrement fermé contenu dans le premier. Le caractère fermé du recouvrement lui permet alors d'utiliser un résultat classique afin d'obtenir une démonstration élégante d'un résultat récent de Ky Fan.
openaire +1 more source
A theorem on the approximation of set cover and vertex cover
1991An approximation result is given, connecting two well known combinatorial problems, the Set Cover and the Vertex Cover. This result constitutes an improvement of the existing ratio for the latter, on a large and intuitive class of graphs, provided that an approximation algorithm exists for the former.
openaire +1 more source
Covering the edges with consecutive sets
Journal of Graph Theory, 1991AbstractThe following question is answered in this note: for which graphs G can the vertices of G be linearly ordered so that all the minimal vertex covers of G are consecutive sets?.
openaire +2 more sources
The Set Cover with Pairs Problem
2005We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects that induces a collection of pairs covering all elements. Formally, let U be a ground set of elements and let ${\cal S}$ be a set of objects, where each object i has a non-negative cost ...
Refael Hassin, Danny Segev
openaire +1 more source
Thematic accuracy assessment of the NLCD 2016 land cover for the conterminous United States
Remote Sensing of Environment, 2021James Wickham, Stephen V Stehman
exaly
Annals of the New York Academy of Sciences, 1970
Stanton, R. G., Kalbfleisch, J. G.
openaire +1 more source
Stanton, R. G., Kalbfleisch, J. G.
openaire +1 more source
Pairs Covered by a Sequence of Sets
2015Enumerating minimal new combinations of elements in a sequence of sets is interesting, e.g., for novelty detection in a stream of texts. The sets are the bags of words occuring in the texts. We focus on new pairs of elements as they are abundant. By simple data structures we can enumerate them in quadratic time, in the size of the sets, but large ...
openaire +1 more source