Minimizing the total cost of barrier coverage in a linear domain
From MaRDI portal
Publication:721928
DOI10.1007/s10878-018-0306-6zbMath1402.90161OpenAlexW2804580808WikidataQ129812887 ScholiaQ129812887MaRDI QIDQ721928
Minming Li, Xiao Zhang, Victor C. S. Lee, Haosheng Fan, Yingchao Zhao, Chuang Liu
Publication date: 20 July 2018
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-018-0306-6
Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain
- Minimizing the aggregate movements for interval coverage
- New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs
- A better constant-factor approximation for weighted dominating set in unit disk graph
- An efficient privacy-preserving compressive data gathering scheme in WSNs
- Weak coverage of a rectangular barrier
- Optimal point movement for covering circular regions
- A PTAS for the disk cover problem of geometric objects
- Coverage by randomly deployed wireless sensor networks
- Maximizing Barrier Coverage Lifetime with Mobile Sensors
- A Novel Node Placement for Long Belt Coverage in Wireless Networks
- Covering Points by Unit Disks of Fixed Location
- Minimizing the Maximum Moving Cost of Interval Coverage
