Parameterized complexity of max-lifetime target coverage in wireless sensor networks

DOI10.1016/j.tcs.2013.06.008zbMath1358.68142OpenAlexW2086579964MaRDI QIDQ391780

Jiong Guo, Weizhong Luo, Jianxin Wang, Jian'er Chen

Publication date: 13 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.06.008

zbMATH Keywords

fixed-parameter tractabilityenergy efficiencyparameterized and exact algorithmtarget coverage

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Improved parameterized algorithms for minimum link-length rectilinear spanning path problem

Cites Work

• Energy efficient monitoring in sensor networks
• Maximum lifetime coverage preserving scheduling algorithms in sensor networks
• An improved exact algorithm for the domatic number problem
• Multiple hypernode hitting sets and smallest two-cores with targets
• Some simplified NP-complete graph problems
• Complexity of the exact domatic number problem and of the exact conveyor flow shop problem
• On a dual version of the one-dimensional bin packing problem
• Minkowski's Convex Body Theorem and Integer Programming
• The NP-Completeness of Edge-Coloring
• Color-coding
• Parameterized and Exact Computation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Parameterized complexity of max-lifetime target coverage in wireless sensor networks