A PTAS FOR MINIMUM d-HOP UNDERWATER SINK PLACEMENT PROBLEM IN 2-D UNDERWATER SENSOR NETWORKS

DOI10.1142/S1793830909000221zbMath1191.68875MaRDI QIDQ3397517

Donghyun Kim, Nassim Sohaee, Wei Wang, Weili Wu, Changcun Ma

Publication date: 22 September 2009

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

polynomial time approximation schemeunderwater sensor networksnetwork center placement problem

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Approximation algorithms (68W25)

Related Items (6)

New dominating sets in social networks ⋮ Two algorithms for minimum 2-connected \(r\)-hop dominating set ⋮ Improved linear problem kernel for planar connected dominating set ⋮ On positive influence dominating sets in social networks ⋮ TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET ⋮ A simpler PTAS for connected \(k\)-path vertex cover in homogeneous wireless sensor network

Cites Work

• Approximation schemes for covering and packing problems in image processing and VLSI

This page was built for publication: A PTAS FOR MINIMUM d-HOP UNDERWATER SINK PLACEMENT PROBLEM IN 2-D UNDERWATER SENSOR NETWORKS