Jun 26, 2022 · We present a combinatorial primal-dual approximation algorithm for the minimum power cover problem with submodular penalties.

In this paper, we introduce the minimum power cover problem with submodular and linear penalties. Suppose U is a set of users and S is a set of sensors in a ...

Oct 19, 2022 · In this paper, we consider the minimum power cover problem with submodular penalty (SPMPC). Given a set U of n users, a set S of m sensors and a penalty ...

Jun 27, 2022 · In this paper, we introduce the minimum power cover problem with submodular and linear penalties. Suppose U is a set of users and S is a set of ...

Oct 22, 2024 · In this paper, we introduce the minimum power cover problem with submodular and linear penalties. Suppose U is a set of users and S is a set of ...

This problem generalizes the well-known minimum power cover problem, minimum power partial cover problem, and k k -prize-collecting minimum power cover problem.

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 ...

In this paper, we consider the minimum power cover problem with submodular penalty (SPMPC). Given a set U of n users, a set S of m sensors and a penalty ...

Oct 22, 2022 · In this paper, we consider the k-prize-collecting minimum vertex cover problem with submodular penalties, which generalizes the well-known minimum vertex cover ...

... Approximation algorithms for the minimum power cover problem with submodular/linear penalties. Theor. Comput. Sci. 923, 256–270. (2022). https://doi.org ...