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

DOI10.1142/S1793830909000142zbMATH Open1189.68177MaRDI QIDQ3397508FDOQ3397508

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)

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

zbMATH Keywords

polynomial time approximation schemeunderwater sensor networkswireless network clusteringMinimum Weight Dominating Set

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Cites Work

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

Cited In (4)

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