Sensor cover and double partition
From MaRDI portal
Publication:2820119
Recommendations
Cites work
- (6 + ε)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs
- A (4 + ε)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs
- A \(5+\varepsilon\)-approximation algorithm for minimum weighted dominating set in unit disk graph
- A better constant-factor approximation for weighted dominating set in unit disk graph
- Adaptive energy efficient sensor scheduling for wireless sensor networks
- Approximation schemes for covering and packing problems in image processing and VLSI
- Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
- Constructing weakly connected dominating set for secure clustering in distributed sensor network
- Design and analysis of approximation algorithms
- Mathematical programming techniques for sensor networks
- New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs
- Node-weighted Steiner tree approximation in unit disk graphs
- On dual power assignment optimization for biconnectivity
- Wireless networking, dominating and packing
This page was built for publication: Sensor cover and double partition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2820119)