Add to ORKGThe multi-objective set covering problem is a classical problem that appears in a number of real-world applications. In combination with a novel approximation algorithm, we compare several parallel methods for finding the optimal solution
The paper presents distributed and parallel δ-approximation algorithms for covering problems, where ...
Introduces the developments in the construction, analysis, and implementation of parallel computing ...
AbstractA simple greedy heuristic algorithm for the multi-criteria set-covering problem is presented...
Abstract: This paper studies a combination problem of parallel machine scheduling and the covering p...
Abstract—This paper aims at better possibilities to solve problems of exponential complexity. Our sp...
In this paper, we study a class of set cover problems that satisfy a special property which we call ...
We give an efficient deterministic parallel approximation algorithm for the minimum-weight vertex- a...
The multiobjective set covering problem (MOSCP), a challenging combinatorial optimization problem, h...
The paper presents distributed and parallel -approximation algorithms for covering problems, where ...
A metaheuristic algorithm is proposed for the solution of the Set Covering Problem. Computational re...
We address the problem of approximating a minimum cycle cover in parallel. We give the first efficie...
We give an efficient deterministic parallel approximation algorithm for the minimumweight vertex- an...
problems admit no algorithms that simultaneously (1) find optimal solution (2) in polynomial time (3...
Abstract: The paper considers a development of approach to construction of parallel algori...
This paper deals with the preprocessing needed for the optimal camera placement problem, which is st...
The paper presents distributed and parallel δ-approximation algorithms for covering problems, where ...
Introduces the developments in the construction, analysis, and implementation of parallel computing ...
AbstractA simple greedy heuristic algorithm for the multi-criteria set-covering problem is presented...
Abstract: This paper studies a combination problem of parallel machine scheduling and the covering p...
Abstract—This paper aims at better possibilities to solve problems of exponential complexity. Our sp...
In this paper, we study a class of set cover problems that satisfy a special property which we call ...
We give an efficient deterministic parallel approximation algorithm for the minimum-weight vertex- a...
The multiobjective set covering problem (MOSCP), a challenging combinatorial optimization problem, h...
The paper presents distributed and parallel -approximation algorithms for covering problems, where ...
A metaheuristic algorithm is proposed for the solution of the Set Covering Problem. Computational re...
We address the problem of approximating a minimum cycle cover in parallel. We give the first efficie...
We give an efficient deterministic parallel approximation algorithm for the minimumweight vertex- an...
problems admit no algorithms that simultaneously (1) find optimal solution (2) in polynomial time (3...
Abstract: The paper considers a development of approach to construction of parallel algori...
This paper deals with the preprocessing needed for the optimal camera placement problem, which is st...
The paper presents distributed and parallel δ-approximation algorithms for covering problems, where ...
Introduces the developments in the construction, analysis, and implementation of parallel computing ...
AbstractA simple greedy heuristic algorithm for the multi-criteria set-covering problem is presented...