Minimum average routing path clustering problem in multi-hop 2-D underwater sensor networks

DOI10.1007/s11590-009-0168-zzbMath1202.90263OpenAlexW2102922002MaRDI QIDQ1958638

Donghyun Kim, Heekuck Oh, Weili Wu, Ling Ding, Wei Wang, Jihwan Lim

Publication date: 4 October 2010

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-009-0168-z

zbMATH Keywords

wireless network clustering

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Minimum connected dominating sets and maximal independent sets in unit disk graphs
• A \(5+\varepsilon\)-approximation algorithm for minimum weighted dominating set in unit disk graph
• A BETTER APPROXIMATION FOR MINIMUM AVERAGE ROUTING PATH CLUSTERING PROBLEM IN 2-D UNDERWATER SENSOR NETWORKS
• A Greedy Heuristic for the Set-Covering Problem

This page was built for publication: Minimum average routing path clustering problem in multi-hop 2-D underwater sensor networks