Results 11 to 20 of about 925,039 (306)
Plummeting Broadcast Storm Problem in Highways by Clustering Vehicles Using Dominating Set and Set Cover [PDF]
Sensors, 2019 “Vehicular Ad-hoc Networks„ (VANETs): As an active research area in the field of wireless sensor networks, they ensure road safety by exchanging alert messages about unexpected events in a decentralized manner.
S. Kamakshi, V. S. Shankar Sriram
doaj +2 more sources
Knapsack with Vertex Cover, Set Cover, and Hitting Set [PDF]
CoRRGiven an undirected graph $\mathcal{G}=(\mathcal{V},\mathcal{E})$, with vertex weights $(w(u))_{u\in\mathcal{V}}$, vertex values $(α(u))_{u\in\mathcal{V}}$, a knapsack size $s$, and a target value $d$, the \vcknapsack problem is to determine if there exists a subset $\mathcal{U}\subseteq\mathcal{V}$ of vertices such that $\mathcal{U}$ forms a vertex ...
Dey, Palash +3 more
openaire +5 more sources
Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1To appear in KDD ...
Mohsen Dehghankar +3 more
openaire +3 more sources
Interactive Submodular Set Cover [PDF]
CoRR, 2010 We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submodular set cover. Applications include advertising in social networks with hidden information.
Andrew Guillory, Jeff A. Bilmes
openaire +3 more sources
On Geometric Set Cover for Orthants. [PDF]
, 2019 AT_PUBLICATION
Karl Bringmann +3 more
core +8 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
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.
Bjørn Kjos-Hanssen +2 more
openaire +6 more sources
Streaming Set Cover in Practice [PDF]
, 2021 State-of-the-art practical algorithms for solving large Set Cover instances can all be regarded as variants of the Greedy Set Cover algorithm. These algorithms maintain the input sets in memory, which yields a substantial memory footprint. In particular,
Barlow, Michael +2 more
openaire +3 more sources
Approximation Algorithm for the Minimum Hub Cover Set Problem
IEEE Access, 2022 A subset ${\mathcal{ S}}\subseteq V$ of vertices of an undirected graph $G=(V,E)$ is a hub cover when for each edge $(u,v) \in E$ , at least one of its endpoints belongs to ${\mathcal{ S}}$ , or there exists a vertex $r \in {\mathcal{ S}}$ that ...
Joel A. Trejo-Sanchez +3 more
doaj +1 more source
On covering by translates of a set [PDF]
Random Structures & Algorithms, 2010 AbstractIn this paper we study the minimal number τ(S,G) of translates of an arbitrary subset S of a group G needed to cover the group, and related notions of the efficiency of such coverings. We focus mainly on finite subsets in discrete groups, reviewing the classical results in this area, and generalizing them to a much broader context. For example,
Bollobas, B, Janson, S, Riordan, O
openaire +3 more sources