Results 11 to 20 of about 2,347,375 (169)
Set covering with our eyes closed [PDF]
SIAM Journal on Computing, 2013 Given a universe $U$ of $n$ elements and a weighted collection $\mathscr{S}$ of $m$ subsets of $U$, the universal set cover problem is to a priori map each element $u \in U$ to a set $S(u) \in \mathscr{S}$ containing $u$ such that any set $X{\subseteq U}$
Grandoni, F +5 more
core +7 more sources
Doklady Mathematics, 2021 Abstract Methods for improving upper and lower bounds for various coverings of planar sets are proposed. New bounds for various numbers of partition constituents are presented, and suggestions for the generalization of the presented methods are offered.
Tolmachev, A. D., Protasov, D. S.
openaire +2 more sources
Dynamic Geometric Set Cover and Hitting Set [PDF]
ACM Transactions on Algorithms, 2022 We investigate dynamic versions of geometric set cover and hitting set where points and ranges may be inserted or deleted, and we want to efficiently maintain an (approximately) optimal solution for the current problem instance. While their static versions have been extensively studied in the past, surprisingly little is known about ...
Pankaj Agarwal +4 more
openaire +7 more sources
Covering the recursive sets [PDF]
Annals of Pure and Applied Logic, 2015 We give solutions to two of the questions in a paper by Brendle, Brooke-Taylor, Ng and Nies. Our examples derive from a 2014 construction by Khan and Miller as well as new direct constructions using martingales. At the same time, we introduce the concept of i.o. subuniformity and relate this concept to recursive measure theory.
Kjos-Hanssen B. +2 more
openaire +6 more sources
Vertex adjacencies in the set covering polyhedron [PDF]
, 2017 We describe the adjacency of vertices of the (unbounded version of the) set covering polyhedron, in a similar way to the description given by Chvatal for the stable set polytope.
Aguilera, Néstor E. +2 more
core +2 more sources
On some covering graphs of a graph
Electronic Journal of Graph Theory and Applications, 2016 For a graph $G$ with vertex set $V(G)=\{v_1, v_2, \dots, v_n\}$, let $S$ be the covering set of $G$ having the maximum degree over all the minimum covering sets of $G$.
Shariefuddin Pirzada +2 more
doaj +1 more source
Effective Approaches to Solve
IEEE Access, 2020 The classic p -center problem consists of choosing a set of p vertices in an undirected graph as facilities in order to minimize the maximum distance between each client vertex and its closest facility.
Xiaolu Liu +5 more
doaj +1 more source
Two Neighbourhood-based Approaches for the Set Covering Problem
U.Porto Journal of Engineering, 2019 The Set Covering Problem is a well-known NP-complete problem which we address in this work. Due to its combinatorial nature heuristic methods, namely neighbourhood-based meta-heuristics, were used.
Eduardo Meca Castro
doaj +1 more source
On applying the set covering model to reseeding [PDF]
, 2001 The Functional BIST approach is a rather new BIST technique based on exploiting embedded system functionality to generate deterministic test patterns during BIST.
Chiusano, Silvia Anna +3 more
core +2 more sources
Constructing Minimal Coverability Sets
Fundamenta Informaticae, 2013 This publication addresses two bottlenecks in the construction of minimal coverability sets of Petri nets: the detection of situations where the marking of a place can be converted to ω, and the manipulation of the set A of maximal ω-markings that have been found so far.
Valmari Antti, Piipponen Artturi
openaire +3 more sources