An Improved Approximation Algorithm for the Minimum Power Cover Problem with Submodular Penalty
In this paper, we consider the minimum power cover problem with submodular penalty (SPMPC). Given a set <i>U</i> of <i>n</i> users, a set <i>S</i> of <i>m</i> sensors and a penalty function <inline-formula><math xmlns="http://www.w3.org/1...
Main Author: | Han Dai |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-10-01
|
Series: | Computation |
Subjects: | |
Online Access: | https://www.mdpi.com/2079-3197/10/10/189 |
Similar Items
-
Approximation Algorithms for the Submodular Load Balancing with Submodular Penalties
by: Xiaofei Liu, et al.
Published: (2020-10-01) -
A Combinatorial 2-Approximation Algorithm for the Parallel-Machine Scheduling with Release Times and Submodular Penalties
by: Wencheng Wang, et al.
Published: (2021-12-01) -
A Primal–Dual-Based Power Control Approach for Capacitated Edge Servers
by: Qinghui Zhang, et al.
Published: (2022-10-01) -
Efficient Streaming Algorithms for Maximizing Monotone DR-Submodular Function on the Integer Lattice
by: Bich-Ngan T. Nguyen, et al.
Published: (2022-10-01) -
Approximation Algorithm for the Minimum Hub Cover Set Problem
by: Joel A. Trejo-Sanchez, et al.
Published: (2022-01-01)