{"type":"ScholarlyArticle","title":"NuCDS: An Efficient Local Search Algorithm for Minimum Connected Dominating Set","authors":[{"name":"Bohan Li","slug":"bohan-li","given":"Bohan","family":"Li","affiliation":"State Key Laboratory of Computer Science , Institute of Software , Chinese Academy of Sciences , China; School of Computer Science and Technology , University of Chinese Academy of Sciences , China"},{"name":"Xindi Zhang","slug":"xindi-zhang","given":"Xindi","family":"Zhang","affiliation":"State Key Laboratory of Computer Science , Institute of Software , Chinese Academy of Sciences , China; School of Computer Science and Technology , University of Chinese Academy of Sciences , China"},{"name":"Shaowei Cai","slug":"shaowei-cai","given":"Shaowei","family":"Cai","affiliation":"State Key Laboratory of Computer Science , Institute of Software , Chinese Academy of Sciences , China; School of Computer Science and Technology , University of Chinese Academy of Sciences , China"},{"name":"Jinkun Lin","slug":"jinkun-lin","given":"Jinkun","family":"Lin","affiliation":"State Key Laboratory of Computer Science , Institute of Software , Chinese Academy of Sciences , China"},{"name":"Yiyuan Wang","slug":"yiyuan-wang","given":"Yiyuan","family":"Wang","affiliation":"School of Computer Science and Information Technology , Northeast Normal University , China"},{"name":"Christian Blum","slug":"christian-blum","given":"Christian","family":"Blum","affiliation":"Artificial Intelligence Research Institute (IIIA-CSIC) , Campus of the UAB , Bellaterra , Spain"}],"abstract":"The minimum connected dominating set (MCDS) problem is an important extension of the minimum dominating set problem, with wide applications, especially in wireless networks. Despite its practical importance, there are few works on solving MCDS for massive graphs, mainly due to the complexity of maintaining connectivity. In this paper, we propose two novel ideas, and develop a new local search algorithm for MCDS called NuCDS. First, a hybrid dynamic connectivity maintenance method is designed to switch alternately between a novel fast connectivity maintenance method based on spanning tree and its previous counterpart. Second, we define a new vertex property called \\emph{safety} to make the algorithm more considerate when selecting vertices. Experiments show that NuCDS significantly outperforms the state-of-the-art MCDS algorithms on  both massive graphs and classic benchmarks.","doi":"10.24963/ijcai.2020/209","url":"https://ijcai.org/proceedings/2020/209","pdf":"https://ijcai.org/proceedings/2020/0209.pdf","markdown":"https://ijcai.org/proceedings/2020/209.md","bibtex":"https://ijcai.org/proceedings/2020/bibtex/209","volume":{"slug":"2020","title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2020","url":"https://ijcai.org/proceedings/2020/","year":2020,"location":"Yokohama","dates":"January 2021 (postponed from 11-17 July 2020)","editors":"Christian Bessiere","isbn":"978-0-9992411-6-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2020"},"section":"Heuristic Search and Game Playing","track":"Main track","number":209,"pages":{"first":1503,"last":1510},"keywords":["Heuristic Search and Game Playing: Combinatorial Search and Optimisation","Heuristic Search and Game Playing: Heuristic Search"],"videos":[{"label":"Video","url":"https://videos.ijcai20.org/24077/file_24077.m3u8","length_sec":267,"provider":"hls"}],"references":[{"position":1,"raw":"[Al-Karaki and Kamal, 2008] Jamal N Al-Karaki and Ahmed E Kamal. Efficient virtual-backbone routing in mobile ad hoc net- works. Computer Networks, 52(2):327-350, 2008.","title":"Efficient virtual-backbone routing in mobile ad hoc networks","authors":"Jamal N Al-Karaki, Ahmed E Kamal","year":"2008","venue":"Computer Networks","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bouamama et al., 2019] Salim Bouamama, Christian Blum, and Jean-Guillaume Fages. An algorithm based on ant colony op- timization for the minimum connected dominating set problem. Applied Soft Computing, 80:672-686, 2019.","title":"An algorithm based on ant colony optimization for the minimum connected dominating set problem","authors":"Salim Bouamama, Christian Blum, Jean-Guillaume Fages","year":"2019","venue":"Applied Soft Computing","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Cai and Su, 2013] Shaowei Cai and Kaile Su. Local search for boolean satisfiability with configuration checking and subscore. Artificial Intelligence, 204:75-98, 2013.","title":"Local search for boolean satisfiability with configuration checking and subscore","authors":"Su ; ] Shaowei Cai, Kaile Cai, Su","year":"2013","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Cai, 2015] Shaowei Cai. Balance between complexity and quality: Local search for minimum vertex cover in massive graphs. In Twenty-Fourth International Joint Conference on Artificial Intel- ligence, pages 747-753, 2015.","title":"Balance between complexity and quality: Local search for minimum vertex cover in massive graphs","authors":"Shaowei Cai, Cai","year":"2015","venue":"Twenty-Fourth International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2015/111"},{"position":5,"raw":"[Cheng et al., 2003] Xiuzhen Cheng, Xiao Huang, Deying Li, Weili Wu, and Ding-Zhu Du. A polynomial-time approxima- tion scheme for the minimum-connected dominating set in ad hoc wireless networks. Networks: An International Journal, 42(4):202-208, 2003.","title":"A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks","authors":"Xiuzhen Cheng, Xiao Huang, Deying Li, Weili Wu, Ding-Zhu Du","year":"2003","venue":"Networks: An International Journal","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Chinnasamy et al., 2019] A Chinnasamy, B Sivakumar, P Selvaku- mari, and A Suresh. Minimum connected dominating set based rsu allocation for smartcloud vehicles in vanet. Cluster Comput- ing, 22(5):12795-12804, 2019.","title":"Minimum connected dominating set based rsu allocation for smartcloud vehicles in vanet","authors":"Chinnasamy, P Sivakumar, Selvakumari, Suresh","year":"2019","venue":"Cluster Computing","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Erdem et al., 2009] Esra Erdem, Fangzhen Lin, and Torsten Schaub, editors. Proceedings of 10th International Conference on Logic Programming and Nonmonotonic Reasoning, volume 5753 of Lecture Notes in Computer Science, 2009.","title":"Proceedings of 10th International Conference on Logic Programming and Nonmonotonic Reasoning","authors":null,"year":"2009","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Fan and Watson, 2012] Neng Fan and Jean-Paul Watson. Solving the connected dominating set problem and power dominating set problem by integer programming. In International conference on combinatorial optimization and applications, pages 371-383, 2012.","title":"Solving the connected dominating set problem and power dominating set problem by integer programming","authors":"Fan, Watson, Neng Fan, Jean-Paul Watson","year":"2012","venue":"International conference on combinatorial optimization and applications","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Fernau et al., 2011] Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, and Peter Rossmanith. An exact algorithm for the maximum leaf spanning tree problem. Theoretical Computer Science, 412(45):6290-6302, 2011.","title":"An exact algorithm for the maximum leaf spanning tree problem","authors":"Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith","year":"2011","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Fomin et al., 2008] Fedor V Fomin, Fabrizio Grandoni, and Dieter Kratsch. Solving connected dominating set faster than 2 n. Algo- rithmica, 52(2):153-166, 2008.","title":"Solving connected dominating set faster than 2 n","authors":"Fabrizio Fedor V Fomin, Dieter Grandoni, Kratsch","year":"2008","venue":"Algorithmica","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Gendron et al., 2014] Bernard Gendron, Abilio Lucena, Alexan- dre Salles da Cunha, and Luidi Simonetti. Benders decompo- sition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem. INFORMS Journal on Com- puting, 26(4):645-657, 2014.","title":"Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem","authors":"Bernard Gendron, Abilio Lucena, Alexandre Salles Da Cunha, Luidi Simonetti","year":"2014","venue":"INFORMS Journal on Computing","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Glover and Laguna, 1998] Fred Glover and Manuel Laguna. Tabu search. In Handbook of combinatorial optimization, pages 2093- 2229. Springer, 1998.","title":"Fred Glover and Manuel Laguna. Tabu search","authors":"Laguna Glover","year":"1998","venue":"Handbook of combinatorial optimization","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Hedar and Ismail, 2012] Abdel-Rahman Hedar and Rashad Ismail. Simulated annealing with stochastic local search for minimum dominating set problem. International Journal of Machine Learning and Cybernetics, 3(2):97-109, 2012.","title":"Abdel-Rahman Hedar and Rashad Ismail. Simulated annealing with stochastic local search for minimum dominating set problem","authors":"Ismail Hedar","year":"2012","venue":"International Journal of Machine Learning and Cybernetics","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Hedar et al., 2019] Abdel-Rahman Hedar, Rashad Ismail, Gamal A El-Sayed, and Khalid M Jamil Khayyat. Two meta- heuristics designed to solve the minimum connected dominating set problem for wireless networks design and management. Journal of Network and Systems Management, 27(3):647-687, 2019.","title":"Two metaheuristics designed to solve the minimum connected dominating set problem for wireless networks design and management","authors":"Hedar","year":"2019","venue":"Journal of Network and Systems Management","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Hopcroft and Tarjan, 1973] John Hopcroft and Robert Tarjan. Al- gorithm 447: efficient algorithms for graph manipulation. Com- munications of the ACM, 16(6):372-378, 1973.","title":"Algorithm 447: efficient algorithms for graph manipulation","authors":"Tarjan Hopcroft, John Hopcroft, Robert Tarjan","year":"1973","venue":"Communications of the ACM","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Jovanovic and Tuba, 2013] Raka Jovanovic and Milan Tuba. Ant colony optimization algorithm with pheromone correction strat- egy for the minimum connected dominating set problem. Com- put. Sci. Inf. Syst., 10(1):133-149, 2013.","title":"Ant colony optimization algorithm with pheromone correction strategy for the minimum connected dominating set problem","authors":"Tuba Jovanovic, Raka Jovanovic, Milan Tuba","year":"2013","venue":"Comput. Sci. Inf. Syst","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Kann, 1992] Viggo Kann. On the approximability of NP-complete optimization problems. PhD thesis, Royal Institute of Technology Stockholm, 1992.","title":"On the approximability of NP-complete optimization problems","authors":"Viggo Kann, Kann","year":"1992","venue":null,"doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Khuller and Yang, 2019] Samir Khuller and Sheng Yang. Revisit- ing connected dominating sets: An almost optimal local informa- tion algorithm. Algorithmica, 81(6):2592-2605, 2019.","title":"Revisiting connected dominating sets: An almost optimal local information algorithm","authors":"Samir Khuller, Sheng Yang","year":"2019","venue":"Algorithmica","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Li et al., 2017] Ruizhi Li, Shuli Hu, Jian Gao, Yupeng Zhou, Yiyuan Wang, and Minghao Yin. Grasp for connected dom- inating set problems. Neural Computing and Applications, 28(1):1059-1067, 2017.","title":"Grasp for connected dominating set problems","authors":"Ruizhi Li, Shuli Hu, Jian Gao, Yupeng Zhou, Yiyuan Wang, Minghao Yin","year":"2017","venue":"Neural Computing and Applications","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Li et al., 2019] Ruizhi Li, Shuli Hu, Huan Liu, Ruiting Li, Dan- tong Ouyang, and Minghao Yin. Multi-start local search al- gorithm for the minimum connected dominating set problems. Mathematics, 7(12):1173, 2019.","title":"Multi-start local search algorithm for the minimum connected dominating set problems","authors":"Ruizhi Li, Shuli Hu, Huan Liu, Ruiting Li, Dantong Ouyang, Minghao Yin","year":"2019","venue":"Mathematics","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Lin et al., 2017] Jinkun Lin, Shaowei Cai, Chuan Luo, and Kaile Su. A reduction based method for coloring very large graphs. In IJCAI, pages 517-523, 2017.","title":"A reduction based method for coloring very large graphs","authors":"Lin","year":"2017","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2017/73"},{"position":22,"raw":"[Lucena et al., 2010] Abilio Lucena, Nelson Maculan, and Luidi Simonetti. Reformulations and solution algorithms for the max- imum leaf spanning tree problem. Computational Management Science, 7(3):289-311, 2010.","title":"Reformulations and solution algorithms for the maximum leaf spanning tree problem","authors":"Abilio Lucena, Nelson Maculan, Luidi Simonetti","year":"2010","venue":"Computational Management Science","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Milenković et al., 2011] Tijana Milenković, Vesna Memišević, Anthony Bonato, and Nataša Pržulj. Dominating biological net- works. PloS one, 6(8):e23016, 2011.","title":"Dominating biological networks","authors":"Tijana Milenković, Vesna Memišević, Anthony Bonato, Nataša Pržulj","year":"2011","venue":"PloS one","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Misra and Mandal, 2009] Rajiv Misra and Chittaranjan Mandal. Minimum connected dominating set using a collaborative cover heuristic for ad hoc sensor networks. IEEE Transactions on par- allel and distributed systems, 21(3):292-302, 2009.","title":"Minimum connected dominating set using a collaborative cover heuristic for ad hoc sensor networks","authors":"Rajiv Misra, Chittaranjan Mandal","year":"2009","venue":"IEEE Transactions on parallel and distributed systems","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Morgan and Grout, 2007] Mike Morgan and Vic Grout. Meta- heuristics for wireless network optimisation. In AICT, pages 15- 15, 2007.","title":"Metaheuristics for wireless network optimisation","authors":"Morgan, Grout, Mike Morgan, Vic Grout","year":"2007","venue":"AICT","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Rossi and Ahmed, 2015] Ryan A Rossi and Nesreen K Ahmed. The network data repository with interactive graph analytics and visualization. pages 4292-4293, 2015.","title":"The network data repository with interactive graph analytics and visualization","authors":"A Ryan, Nesreen K Rossi, Ahmed","year":"2015","venue":null,"doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Ruan et al., 2004] Lu Ruan, Hongwei Du, Xiaohua Jia, Weili Wu, Yingshu Li, and Ker-I Ko. A greedy approximation for mini- mum connected dominating sets. Theoretical Computer Science, 329(1-3):325-330, 2004.","title":"A greedy approximation for minimum connected dominating sets","authors":"Lu Ruan, Hongwei Du, Xiaohua Jia, Weili Wu, Yingshu Li, Ker-I Ko","year":"2004","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Simonetti et al., 2011] Luidi Simonetti, Alexandre Salles Da Cunha, and Abilio Lucena. The minimum connected dominating set problem: Formulation, valid inequalities and a branch-and-cut algorithm. In International Conference on Network Optimization, pages 162-169. Springer, 2011.","title":"The minimum connected dominating set problem: Formulation, valid inequalities and a branch-and-cut algorithm","authors":"Simonetti","year":"2011","venue":"International Conference on Network Optimization","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Wang et al., 2017] Yiyuan Wang, Shaowei Cai, and Minghao Yin. Local search for minimum weight dominating set with two-level configuration checking and frequency based scoring function. Journal of Artificial Intelligence Research, 58:267-295, 2017.","title":"Local search for minimum weight dominating set with two-level configuration checking and frequency based scoring function","authors":"Wang","year":"2017","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Wu et al., 2017] Xinyun Wu, Zhipeng Lü, and Philippe Galinier. Restricted swap-based neighborhood search for the minimum connected dominating set problem. Networks, 69(2):222-236, 2017.","title":"Restricted swap-based neighborhood search for the minimum connected dominating set problem","authors":"Xinyun Wu, Zhipeng Lü, Philippe Galinier","year":"2017","venue":"Networks","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}