Minimizing the total cost of barrier coverage in a linear domain
From MaRDI portal
(Redirected from Publication:721928)
Recommendations
Cites work
- A Novel Node Placement for Long Belt Coverage in Wireless Networks
- A PTAS for the disk cover problem of geometric objects
- A better constant-factor approximation for weighted dominating set in unit disk graph
- An efficient privacy-preserving compressive data gathering scheme in WSNs
- Coverage by randomly deployed wireless sensor networks
- Covering Points by Unit Disks of Fixed Location
- Maximizing Barrier Coverage Lifetime with Mobile Sensors
- Minimizing the maximum moving cost of interval coverage
- New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs
Cited in
(7)- A 2-approximation algorithm for barrier coverage by weighted non-uniform sensors on a line
- The minimum barrier distance: a summary of recent advances
- Improved PTASs for convex barrier coverage
- scientific article; zbMATH DE number 7760172 (Why is no real title available?)
- Optimising the barrier coverage of a wireless sensor network with hub-and-spoke topology using mathematical and simulation models
- Algorithm for partial sweep coverage on a line
- Approximation Algorithms for Barrier Sweep Coverage
This page was built for publication: Minimizing the total cost of barrier coverage in a linear domain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q721928)