A BETTER APPROXIMATION FOR MINIMUM AVERAGE ROUTING PATH CLUSTERING PROBLEM IN 2-D UNDERWATER SENSOR NETWORKS

DOI10.1142/S1793830909000142MaRDI QIDQ3397508zbMATH OpenFDO

Authors Wei Wang, Donghyun Kim, James Willson, Bhavani Thuraisingham, Weili Wu

Publication date 22 September 2009

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

zbMATH Keywords

polynomial time approximation schemeunderwater sensor networkswireless network clusteringMinimum Weight Dominating Set

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Recommendations

• Minimum average routing path clustering problem in multi-hop 2-D underwater sensor networks
• A PTAS FOR MINIMUM d-HOP UNDERWATER SINK PLACEMENT PROBLEM IN 2-D UNDERWATER SENSOR NETWORKS
• Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks
• PTAS for minimum connected dominating set with routing cost constraint in wireless sensor networks
• Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks

Cites work

• A \(5+\varepsilon\)-approximation algorithm for minimum weighted dominating set in unit disk graph
• Planar Formulae and Their Uses

Cited in

(4)

• A PTAS FOR MINIMUM d-HOP UNDERWATER SINK PLACEMENT PROBLEM IN 2-D UNDERWATER SENSOR NETWORKS
• On positive influence dominating sets in social networks
• Minimum average routing path clustering problem in multi-hop 2-D underwater sensor networks
• New dominating sets in social networks

This page was built for publication: A BETTER APPROXIMATION FOR MINIMUM AVERAGE ROUTING PATH CLUSTERING PROBLEM IN 2-D UNDERWATER SENSOR NETWORKS

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