SOFSEM 2006: Theory and Practice of Computer Science

DOI10.1007/11611257MaRDI QIDQ5898002zbMATH OpenOpenAlexFDO

Authors Jukka Suomela

Publication date 14 November 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11611257

Mathematics Subject Classification ID

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

Recommendations

• Relay Node Placement in Wireless Sensor Networks
• On optimal placement of relay nodes for reliable connectivity in wireless sensor networks
• Algorithmic Aspects of Wireless Sensor Networks
• Sensor networks and distributed CSP: communication, computation and complexity
• Optimal relay node placement in delay constrained wireless sensor network design
• Complexity of Network Reliability and Optimal Resource Placement Problems
• Computing and Combinatorics

Cited in

(2)

• A survey on relay placement with runtime and approximation guarantees
• A constraint programming approach to the additional relay placement problem in wireless sensor networks

This page was built for publication: SOFSEM 2006: Theory and Practice of Computer Science

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5898002)