Author:
Elloumi Sourour,Hudry Olivier,Marie Estel,Martin Agathe,Plateau Agnès,Rovedakis Stéphane
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference22 articles.
1. Bonsma, P. (2012). Max-leaves spanning tree is APX-hard for cubic graphs. Journal of Discrete Algorithms, 12, 14–23.
2. Chakrabarty, K., Iyengar, S. S., Qi, H., & Cho, E. (2002). Grid coverage for surveillance and target location in distributed sensor networks. IEEE Transactions on Computers, 51(12), 1448–1453.
3. Das B, Bharghavan V (1997) Routing in ad-hoc networks using minimum connected dominating sets. In Communications, ICC ’97 Montreal, towards the knowledge millennium (Vol. 1, pp. 376–380). IEEE
4. Fan N, Watson J (2012) Solving the connected dominating set problem and power dominating set problem by integer programming. In Combinatorial Optimization and Applications: 6th International Conference (COCOA), Springer, Lecture Notes in Computer Science (Vol. 7402, pp. 371–383). https://doi.org/10.1007/978-3-642-31770-5_33.
5. Fourer, R., Gay, D. M., & Kernighan, B. W. (1993). AMPL: A modeling language for mathematical programming. Danvers: The Scientific Press (now an imprint of Boyd & Fraser Publishing Co.).
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献