Nov 20, 2021 · In this paper, we introduce the k-prize-collecting minimum power cover problem (k-PCPC), which generalizes the minimum power cover problem (MPC) ...
Oct 22, 2022 · We design a two-phase combinatorial algorithm based on the guessing technique and the primal-dual framework to address the problem. When the ...
A two-phase primal-dual algorithm for the k-prize-collecting minimum power cover problem, which generalizes the well-known minimum power covered problem.
We design a two-phase combinatorial algorithm based on the guessing technique and the primal-dual framework to address the problem. When the submodular penalty ...
Aug 23, 2023 · This problem is to select a vertex set that covers at least k edges, and the objective is to minimize the total cost of the vertices in the selected set plus ...
Missing: power | Show results with:power
This paper presents a primal-dual algorithm for MinPPC with approximation ratio at most 3 α, which coincides with the best known ratio for the minimum power ...
This problem generalizes the well-known minimum power cover problem, minimum power partial cover problem, and k k -prize-collecting minimum power cover problem.
This problem determines a vertex set S ⊆ V such that S covers at least k edges. The objective is to minimize the total cost of the vertices in S ...
The objective is to minimize the total power of the set of disks F plus the penalty of R , where R is the set of points that are not covered by F . It has been ...
Jun 26, 2022 · We present a combinatorial primal-dual approximation algorithm for the minimum power cover problem with submodular penalties.