Energy efficient monitoring in sensor networks

DOI10.1007/s00453-010-9407-zzbMath1206.68033OpenAlexW2091889409MaRDI QIDQ627527

Azarakhsh Malekian, Mohammed Toossi, Amol Deshpande, Samir Khuller

Publication date: 2 March 2011

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-010-9407-z

zbMATH Keywords

approximation algorithmenergy efficiencysensor networkstarget monitoring

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (1)

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

Uses Software

• TAG

Cites Work

• A simple algorithm for edge-coloring bipartite multigraphs
• .879-approximation algorithms for MAX CUT and MAX 2SAT
• On maximizing welfare when utility functions are subadditive
• Approximating theDomatic Number
• Node-and edge-deletion NP-complete problems
• Some optimal inapproximability results
• Coloring Geometric Range Spaces
• Energy Efficient Monitoring in Sensor Networks
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Energy efficient monitoring in sensor networks