K-Connected Target Coverage Problem in Wireless Sensor Networks

DOI10.1007/978-3-540-73556-4_5zbMath1175.90090OpenAlexW1508636908MaRDI QIDQ3611947

No author found.

Publication date: 3 March 2009

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73556-4_5

zbMATH Keywords

heuristic algorithmswireless sensor networksNP-hard problems\(k\)-connected augmentation\(k\)-connected target coverage

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Approximation methods and heuristics in mathematical programming (90C59) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: K-Connected Target Coverage Problem in Wireless Sensor Networks