Author:
Du Hongwei,Pardalos Panos M.,Wu Weili,Wu Lidong
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Management Science and Operations Research,Control and Optimization,Computer Science Applications
Reference16 articles.
1. Ambühl, C., Erlebach, T., Mihalák, M., Nunkesser, M.: Constant-approximation for minimum-weight (connected) dominating sets in unit disk graphs. In: Proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX 2006), LNCS 4110, Springer, pp. 3–14 (2006)
2. Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. In: Proceedings of the FOCS, pp. 265–273 (1983)
3. Boginski, V.L., Commander, C.W., Pardalos, P.M., Ye, Y. (eds): Sensors: Theory, Algorithms, and Applications. Springer, Berlin (2012)
4. Du D.-Z., Ko K.-I., Hu X.: Design and Analysis of Approximation Algorithms, pp. 142–157. Springer, Berlin (2012)
5. Du H., Wu W., Shan S., Kim D., Lee W.: Constructing weakly connected dominating set for secure clustering in distributed sensor network. J. Comb. Optim. 23, 301–307 (2012)
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献