Results 21 to 30 of about 149,933 (163)
On the Partition Set Cover Problem
CoRR, 2018 Several algorithms with an approximation guarantee of $O(\log n)$ are known for the Set Cover problem, where $n$ is the number of elements. We study a generalization of the Set Cover problem, called the Partition Set Cover problem. Here, the elements are partitioned into $r$ \emph{color classes}, and we are required to cover at least $k_t$ elements ...
Tanmay Inamdar 0002 +1 more
openaire +2 more sources
THE MODEL FOR DETERMINING LOCATION OF NAVAL BASE USING AHP METHOD AND SET COVERING PROBLEM [PDF]
Russian Journal of Agricultural and Socio-Economic Sciences, 2020 Indonesia is a nation that has a lot of island with most of its territory (2/3) is the sea and the rest of it (1/3) island that consist of many islands, this kind of geographical condition insist Indonesian Government control and guaranty its sea ...
Purnomo J. +3 more
doaj +1 more source
Mathematics, 2023 This research aims to explain the intrinsic difficulty of Karp’s list of twenty-one problems through the use of empirical complexity measures based on the ellipsoidal width of the polyhedron generated by the constraints of the relaxed linear programming ...
Ivan Derpich, Juan Valencia, Mario Lopez
doaj +1 more source
On the set multi-cover problem in geometric settings
Proceedings of the twenty-fifth annual symposium on Computational geometry, 2009 We consider the set multi-cover problem in geometric settings. Given a set of points P and a collection of geometric shapes (or sets) F, we wish to find a minimum cardinality subset of F such that each point p in P is covered by (contained in) at least d(p) sets. Here d(p) is an integer demand (requirement) for p.
Chandra Chekuri +2 more
openaire +2 more sources
On the Advice Complexity of the Set Cover Problem [PDF]
, 2012 Recently, a new approach to get a deeper understanding of online computation has been introduced: the study of the advice complexity of online problems. The idea is to measure the information that online algorithms need to be supplied with to compute high-quality solutions and to overcome the drawback of not knowing future input requests.
Dennis Komm +2 more
openaire +3 more sources
The minimum-entropy set cover problem
Theoretical Computer Science, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eran Halperin, Richard M. Karp
openaire +2 more sources
Set covering problem with conflict constraints [PDF]
Computers & Operations Research, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Saeed Saffari, Yahya Fathi
openaire +2 more sources
An Ant Colony based Hyper-Heuristic Approach for the Set Covering Problem
Advances in Distributed Computing and Artificial Intelligence Journal, 2015 The Set Covering Problem (SCP) is a NP-hard combinatorial optimization problem that is challenging for meta-heuristic algorithms. In the optimization literature, several approaches using meta-heuristics have been developed to tackle the SCP and the ...
Alexandre Silvestre FERREIRA +2 more
doaj +1 more source
A note on the Clustered Set Covering Problem
Discrete Applied Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alfandari, Laurent, Monnot, Jérôme
openaire +1 more source
A column generation approach to the airline crew pairing problem to minimize the total person-days
Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2016 In this paper, we consider the crew pairing problem in airline scheduling that calls for assigning crew members in order to cover all flights with the minimum total person-days under the constraints that the schedule of each crew member does not violate ...
Wei WU +5 more
doaj +1 more source