Results 11 to 20 of about 504,784 (313)
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
Dynamic Geometric Set Cover and Hitting Set
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 K. Agarwal +4 more
openaire +4 more sources
Applied Sciences, 2020 This paper presents an extension of the covering location problem as a hybrid covering model that utilizes the set covering and maximal covering location problems. The developed model is a multi-period model that considers strategic and tactical planning
Roghayyeh Alizadeh, Tatsushi Nishi
doaj +1 more source
Cyber Risk Assessment and Optimization: A Small Business Case Study
IEEE Access, 2023 Assessing and controlling cyber risk is the cornerstone of information security management, but also a formidable challenge for organisations due to the uncertainties associated with attacks, the resulting risk exposure, and the availability of scarce ...
Maria Tsiodra +3 more
doaj +1 more source
The online set cover problem [PDF]
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, 2003 Let $X=\{1,2,\ldots,n\}$ be a ground set of $n$ elements, and let ${\cal S}$ be a family of subsets of $X$, $|{\cal S}|=m$, with a positive cost $c_S$ associated with each $S\in{\cal S}$. Consider the following online version of the set cover problem, described as a game between an algorithm and an adversary.
Noga Alon +4 more
openaire +2 more sources
A Surprisal-Based Greedy Heuristic for the Set Covering Problem
Algorithms, 2023 In this paper we exploit concepts from Information Theory to improve the classical Chvatal greedy algorithm for the set covering problem. In particular, we develop a new greedy procedure, called Surprisal-Based Greedy Heuristic (SBH), incorporating the ...
Tommaso Adamo +3 more
doaj +1 more source
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
Location and Coverage Analysis of Bike- Sharing Stations in University Campus
Business Systems Research, 2018 Background: Bike-sharing programmes have become popular in a large number of cities in order to facilitate bicycle use. Determining the location of bike sharing stations is vital to success of these programmes.
Mete Suleyman +2 more
doaj +1 more source