1. Akyildiz, I.F., Pompili, D., Melodia, T.: Underwater acoustic sensor networks: research challenges. Ad Hoc Network 3(3), 257–279 (2005)
2. Ambühl, C., Erlebach, T., Mihalák, M., Nunkesser, M.: Constant-approximation for minimum-weight (connected) dominating sets in unit disk graphs. Proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX 2006). Lecture Notes in Computer Science, vol. 4110 pp. 3–14. Springer, Berlin (2006)
3. Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41(1), 153–180 (1994)
4. Baudis, G., Gröpl, C., Hougardy, S., Nierhoff, T., Prömel, H.J.: Approximating minimum spanning sets in hypergraphs and polymatroids. Technical Report, Humboldt-Universitt zu Berlin (2000)
5. Benini, L., Castelli, G., Macii, A., Poncino, M., Scarsi, R.: A discrete-time battery model for high-level power estimation. Proceedings of DATE, pp. 35–39 (2000)