Sensor cover and double partition

DOI10.1007/978-1-4614-8588-9_13zbMATH Open1344.90067OpenAlexW115420388MaRDI QIDQ2820119FDOQ2820119

Authors: Lidong Wu, Weili Wu, Zaixin Lu, Yuqing Zhu, Du Ding-Zhu 

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

Recommendations

• Multi cover of a polygon minimizing the sum of areas
• Decomposing coverings and the planar sensor cover problem
• Approximation algorithms for the connected sensor cover problem
• Approximation algorithms for the connected sensor cover problem
• Multi cover of a polygon minimizing the sum of areas

zbMATH Keywords

wireless sensor networkminimum set coverdouble partitionminimum sensor cover

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation algorithms (68W25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• 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
• Wireless networking, dominating and packing
• New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs
• Constructing weakly connected dominating set for secure clustering in distributed sensor network
• Mathematical programming techniques for sensor networks
• Design and analysis of approximation algorithms
• Node-weighted Steiner tree approximation 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
• On dual power assignment optimization for biconnectivity
• A (4 + ε)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs
• (6 + ε)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs

Cited In (1)

• Multi cover of a polygon minimizing the sum of areas

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)