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

DOI10.1142/S1793830909000142zbMath1189.68177MaRDI QIDQ3397508

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

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)

Related Items (3)

New dominating sets in social networks ⋮ On positive influence dominating sets in social networks ⋮ Minimum average routing path clustering problem in multi-hop 2-D underwater sensor networks

Cites Work

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

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