Sensor Cover and Double Partition
From MaRDI portal
Publication:2820119
DOI10.1007/978-1-4614-8588-9_13zbMath1344.90067OpenAlexW115420388MaRDI QIDQ2820119
Yuqing Zhu, Zaixin Lu, Ding-Zhu Du, Lidong Wu, Weili Wu
Publication date: 13 September 2016
Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-8588-9_13
Programming involving graphs or networks (90C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)
Cites Work
- Constructing weakly connected dominating set for secure clustering in distributed sensor network
- New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs
- Design and analysis of approximation algorithms
- Node-weighted Steiner tree approximation in unit disk graphs
- On dual power assignment optimization for biconnectivity
- 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
- Mathematical programming techniques for sensor networks
- Wireless networking, dominating and packing
- Adaptive energy efficient sensor scheduling for wireless sensor networks
- (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
- 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: Sensor Cover and Double Partition
