-
1
The Covering Problem
Published 2018-07-01“…The main contribution of this paper is a suitable candidate to play this role: the Covering Problem. We motivate this problem with 3 arguments. …”
Get full text
Article -
2
The Angular Set Covering Problem
Published 2024-01-01“…We present an innovative extension of the Set Covering Problem, transitioning from a traditional radial covering to an angular covering structure. …”
Get full text
Article -
3
-
4
Efficient Approximation for Restricted Biclique Cover Problems
Published 2018-06-01“…We show that this practical version of the biclique cover problem is amenable to efficient approximations.…”
Get full text
Article -
5
Weighted geometric set cover problems revisited
Published 2012-05-01“…We study several set cover problems in low dimensional geometric settings. …”
Get full text
Article -
6
On Streaming and Communication Complexity of the Set Cover Problem
Published 2015“…We develop the first streaming algorithm and the first two-party communication protocol that uses a constant number of passes/rounds and sublinear space/communication for logarithmic approximation to the classic Set Cover problem. Specifically, for n elements and m sets, our algorithm/protocol achieves a space bound of O(m ·n [superscript δ] log[superscript 2] n logm) using O(4[superscript 1/δ]) passes/rounds while achieving an approximation factor of O(4[superscript 1/δ]logn) in polynomial time (for δ = Ω(1/logn)). …”
Get full text
Get full text
Get full text
Get full text
Get full text
Article -
7
On the Computational Complexity of Optimization Convex Covering Problems of Graphs
Published 2020-09-01Get full text
Article -
8
The parsimonious property of cut covering problems and its applications
Published 2009Get full text
Working Paper -
9
-
10
Utilizing Heuristics and Metaheuristics for Solving the Set Covering Problem
Published 2024-07-01“… A basic combinatorial optimization problem, the Set Covering Problem (SCP) finds extensive use in computer science, operations research, and logistics, among other domains. …”
Get full text
Article -
11
Two Neighbourhood-based Approaches for the Set Covering Problem
Published 2019-02-01Subjects: Get full text
Article -
12
-
13
Application of genetic algorithm for the set-covering problem solution
Published 2016-09-01Subjects: Get full text
Article -
14
A Local Branching Approach for the Set Covering Problem
Published 2014-05-01Subjects: Get full text
Article -
15
An Improved Memetic Algorithm for the Partial Vertex Cover Problem
Published 2019-01-01“…As a generalized form of the classical minimum vertex cover problem (MVCP), the minimum partial vertex cover problem not only inherits the value of MVCP in both theoretical and practical research but also extends the application scenarios under the current era of big data. …”
Get full text
Article -
16
Dynamic Hub Covering Problem with Flexible Covering Radius
Published 2015-09-01Subjects: Get full text
Article -
17
Approximation of Euclidean k-size cycle cover problem
Published 2014-12-01“…We call this problem the Minimumweight k-size cycle cover problem (or Min-k-SCCP) due to the fact that the problem has the following mathematical statement. …”
Get full text
Article -
18
Towards Tight Bounds for the Streaming Set Cover Problem
Published 2018“…We consider the classic Set Cover problem in the data stream model. For n elements and m sets (m ≥ n) we give a O(1/δ)-pass algorithm with a strongly sub-linear ~O(mn[superscript δ]) space and logarithmic approximation factor. …”
Get full text
Get full text
Get full text
Get full text
Article -
19
Competitive algorithms for online matching and vertex cover problems
Published 2014Get full text
Thesis -
20
On reserve and double covering problems for the sets with non-Euclidean metrics
Published 2019-01-01Subjects: “…covering problem…”
Get full text
Article