Pages that link to "Item:Q2046270"
From MaRDI portal
The following pages link to Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks (Q2046270):
Displaying 13 items.
- A primal-dual approximation algorithm for the \(k\)-prize-collecting minimum power cover problem (Q2080830) (← links)
- A primal-dual algorithm for the minimum power partial cover problem (Q2082206) (← links)
- Constant-approximation for prize-collecting min-sensor sweep coverage with base stations (Q2151357) (← links)
- A note on the minimum power partial cover problem on the plane (Q2165259) (← links)
- Minimum power partial multi-cover on a line (Q2661770) (← links)
- Approximation algorithms for the minimum power cover problem with submodular/linear penalties (Q2672626) (← links)
- Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks (Q5056047) (← links)
- Constant Approximation for the Lifetime Scheduling Problem of <i>p</i>-Percent Coverage (Q5058008) (← links)
- Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments (Q5084628) (← links)
- An improved approximation algorithm for the \(k\)-prize-collecting minimum power cover problem (Q6149344) (← links)
- An approximation algorithm for the minimum soft capacitated disk multi-coverage problem (Q6535281) (← links)
- A 1/2 approximation algorithm for energy-constrained geometric coverage problem (Q6535282) (← links)
- PTAS for minimum cost multicovering with disks (Q6593767) (← links)
