A novel local search algorithm for the minimum capacitated dominating set

References

• Barilan, J., Kortsarz, G., & Peleg, D. (1993). How to allocate network centers. Journal of Algorithms, 15(3), 385–415.
   Web of Science ®Google Scholar
• Basagni, S. (1999). Distributed clustering for ad hoc networks. In Proceedings ISPAN-99 International Symposium on Parallel Architectures Algorithms and Networks, pp. 310–315.
   Google Scholar
• Becker, A. (2016). Capacitated dominating set on planar graphs. arXiv preprint arXiv:1604.04664.
   Google Scholar
• Bevan, D., & Vaduvur, B. (1997). Routing in ad-hoc networks using minimum connected dominating sets. In Proceedings of the 1997 IEEE International Conference on Communications (ICC’97). IEEE, pp. 376–380.
   Google Scholar
• Cai, S., & Su, K. (2011). Local search with configuration checking for SAT. In 23rd IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE, 2011, pp. 59–66.
   Google Scholar
• Cai, S., & Su, K. (2012). Configuration checking with aspiration in local search for SAT. AAAI.
   Google Scholar
• Cai, S., & Su, K. (2013a). Local search for Boolean Satisfiability with configuration checking and subscore. Artificial Intelligence, 204(9), 75–98.
   Web of Science ®Google Scholar
• Cai, S., & Su, K. (2013b). Comprehensive score: towards efficient local search for SAT with long clauses. In Proceedings of the Twenty- Third International Joint Conference on Artificial Intelligence (pp. 489–495). New York, NY: AAAI Press.
   Google Scholar
• Cygan, M., Pilipczuk, M., & Wojtaszczyk, J. O. (2010). Capacitated domination faster than O (2ⁿ). Algorithm theory-SWAT 2010 (pp. 74–80). Berlin: Springer.
   Google Scholar
• Erciyes, K., Dagdeviren, O., Cokuslu, D., & Ozsoyeller, D. (2007). Graph theoretic clustering algorithms in mobile ad hoc networks and wireless sensor networks. Applied and Computational Mathematics, 6(2), 162–180.
   Web of Science ®Google Scholar
• Gao, J., Wang, J. N., & Yin, M. H. (2015). Experimental analyses on phase transitions in compiling satisfiability problems. Science China Information Sciences, 58(3), 1–11.
   Web of Science ®Google Scholar
• Gao, J., Li, R., & Yin, M. (2017). A randomized diversification strategy for solving satisfiability problem with long clauses. Science China Information Sciences, 60(9), 092109.
   Web of Science ®Google Scholar
• Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. San Francisco, LA: Freeman.
   Google Scholar
• Hutter, F., Tompkins, D. A. D., & Hoos, H. H. (2002). Scaling and probabilistic smoothing: efficient dynamic local search for SAT. In Proceedings of CP-02, pp. 233–248.
   Google Scholar
• Jovanovic, R., Tuba, M., & Simian D. (2010). Ant colony optimization applied to minimum weight dominating set problem. In Proceedings of the 12th WSEAS International Conference on Automatic Control, Modelling and Simulation (ACMOS’10), pp. 322–326.
   Google Scholar
• Kao, M. J., & Chen, H. L. (2010). Approximation algorithms for the capacitated domination problem. Frontiers in Algorithmics (pp. 185–196). Berlin: Springer.
   Google Scholar
• Kuhn, F., & Moscibroda, T. (2010). Distributed approximation of capacitated dominating sets. Theory of Computing Systems, 47(4), 811–836.
   Web of Science ®Google Scholar
• Li, R., Hu, S., Gao, J., Zhou, Y., Wang, Y., & Yin, M. (2016a). GRASP for connected dominating set problems. Neural Computing and Applications. doi:10.1007/s00521-016-2429-y
   PubMed Web of Science ®Google Scholar
• Li, R., Hu, S., Wang, Y., & Yin, M. (2016b). A local search algorithm with tabu strategy and perturbation mechanism for generalized vertex cover problem. Neural Computing and Applications. doi:10.1007/s00521-015-2172-9
   PubMed Web of Science ®Google Scholar
• Li, R., Hu, S., Zhang, H., & Yin, M. (2016c). An efficient local search for the minimum weighted vertex cover problem. Information Sciences, 372(12), 428–445.
   Web of Science ®Google Scholar
• Liedloff, M., Todinca, I., & Villanger, Y. (2014). Solving capacitated dominating set by using covering by subsets and maximum matching. Discrete Applied Mathematics, 168(5), 60–68.
   Web of Science ®Google Scholar
• Mansouri, S. A., & Aktas, E. (2016). Minimizing energy consumption and makespan in a two-machine flowshop scheduling problem. Journal of the Operational Research Society, 67(11), 1382–1394.
   Web of Science ®Google Scholar
• Mastrogiovanni M. (2007). The Clustering Simulation Framework: A Simple Manual. Retrieved from http://www.michele-mastrogiovanni.net/software/download/README.pdf
   Google Scholar
• Nocetti, F., Gonzalez, J., & Stojmenovic, I. (2003). Connectivity-based k-hop clustering in wireless networks. Telecommunication Systems, 22(1–4), 205–220.
   Web of Science ®Google Scholar
• Potluri, A., & Singh, A. (2012). A greedy heuristic and its variants for minimum capacitated dominating set. Contemporary computing (pp. 28–39). Berlin: Springer.
   Google Scholar
• Potluri, A., & Singh, A. (2013). Metaheuristic algorithms for computing capacitated dominating set with uniform and variable capacities. Swarm and Evolutionary Computation, 13(13), 22–33.
   Web of Science ®Google Scholar
• Thornton, J., Pham, D. N., Bain, S., & Ferreira, V., Jr (2002). Additive versus multiplicative clause weighting for SAT. AAAI, 2004, 191–196.
   Google Scholar
• Tunalıoğlu, R., Koç, Ç., & Bektaş, T. (2016). A multiperiod location-routing problem arising in the collection of Olive Oil Mill Wastewater. Journal of the Operational Research Society, 67(7), 1012–1024.
   Web of Science ®Google Scholar
• Wang, Y. Y., Ouyang, D. T., Zhang, L. M., & Yin, M. H. (2012). A novel local search for unicost set covering problem using hyperedge configuration checking and weight diversity. Science China Information Sciences. doi:10.1007/s11432-015-5377-8
   Web of Science ®Google Scholar
• Wang, Y., Cai, S., & Yin, M. (2017). Local search for minimum weight dominating set with two-level configuration checking and frequency based scoring function. Journal of Artificial Intelligence Research, 58(2017), 267–295.
   Web of Science ®Google Scholar
• Wu, J., & Li, H. (1999). On calculating connected dominating set for efficient routing in ad hoc wireless networks. In Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communication (DIALM 1999), Seattle, pp. 7–14.
   Google Scholar
• Zhang, X., Li, X., & Wang, J. (2016). Local search algorithm with path relinking for single batch-processing machine scheduling problem. Neural Computing and Applications., 1–14. doi:10.1007/s00521-016-2339-z
   Web of Science ®Google Scholar
• Zhou, Y., Zhang, H., Li, R., & Wang, J. (2016). Two local search algorithms for partition vertex cover problem. Journal of Computational and Theoretical Nanoscience, 13(1), 743–751.
   Google Scholar