Wang, Wei; Kim, Donghyun; Willson, James; Thuraisingham, Bhavani; Wu, Weili A better approximation for minimum average routing path clustering problems in 2-D underwater sensor networks. (English) Zbl 1189.68177 Discrete Math. Algorithms Appl. 1, No. 2, 175-191 (2009). Cited in 3 Documents MSC: 68W25 Approximation algorithms Keywords:polynomial time approximation scheme; underwater sensor networks; wireless network clustering; Minimum Weight Dominating Set PDF BibTeX XML Cite \textit{W. Wang} et al., Discrete Math. Algorithms Appl. 1, No. 2, 175--191 (2009; Zbl 1189.68177) Full Text: DOI References: [1] DOI: 10.1016/j.adhoc.2005.01.004 · Zbl 05387658 · doi:10.1016/j.adhoc.2005.01.004 [2] DOI: 10.1109/COMST.2005.1423333 · doi:10.1109/COMST.2005.1423333 [3] DOI: 10.1023/A:1024688116418 · Zbl 01977783 · doi:10.1023/A:1024688116418 [4] DOI: 10.1016/j.tcs.2008.11.015 · Zbl 1162.68042 · doi:10.1016/j.tcs.2008.11.015 [5] DOI: 10.1016/S1389-1286(01)00302-4 · doi:10.1016/S1389-1286(01)00302-4 [6] DOI: 10.1137/0211025 · Zbl 0478.68043 · doi:10.1137/0211025 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.