Maximum lifetime connected coverage with two active-phase sensors
From MaRDI portal
Publication:2392753
DOI10.1007/s10898-012-9871-xzbMath1275.90024OpenAlexW2081255726MaRDI QIDQ2392753
Weili Wu, Panos M. Pardalos, Lidong Wu, Hongwei David Du
Publication date: 2 August 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-9871-x
Related Items (2)
Constant Approximation for the Lifetime Scheduling Problem of p-Percent Coverage ⋮ A simple approximation algorithm for minimum weight partial connected set cover
Cites Work
- Constructing weakly connected dominating set for secure clustering in distributed sensor network
- Design and analysis of approximation algorithms
- Node-weighted Steiner tree approximation in unit disk graphs
- On dual power assignment optimization for biconnectivity
- A better constant-factor approximation for weighted dominating set in unit disk graph
- Mathematical programming techniques for sensor networks
- Wireless networking, dominating and packing
- Adaptive energy efficient sensor scheduling for wireless sensor networks
- Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
- Approximation schemes for covering and packing problems in image processing and VLSI
This page was built for publication: Maximum lifetime connected coverage with two active-phase sensors
