{"type":"ScholarlyArticle","title":"Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function (Extended Abstract)","authors":[{"name":"Yiyuan Wang","slug":"yiyuan-wang","given":"Yiyuan","family":"Wang","affiliation":"School of Computer Science and Information Technology , Northeast Normal University , 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"},{"name":"Minghao Yin","slug":"minghao-yin","given":"Minghao","family":"Yin","affiliation":"School of Computer Science and Information Technology , Northeast Normal University , China"}],"abstract":"The Minimum Weight Dominating Set (MWDS) problem is an important generalization of the Minimum Dominating Set (MDS) problem with extensive applications. This paper proposes a new local search algorithm for the MWDS problem, which is based on two new ideas. The first idea is a heuristic called two-level configuration checking (CC2), which is a new variant of a recent powerful configuration checking strategy (CC) for effectively avoiding the recent search paths. The second idea is a novel scoring function based on the frequency of being uncovered of vertices. Our algorithm is called CC2FS, according to the names of the two ideas. The experimental results show that, CC2FS performs much better than some state-of-the-art algorithms in terms of solution quality on a broad range of MWDS benchmarks.","doi":"10.24963/ijcai.2017/728","url":"https://ijcai.org/proceedings/2017/728","pdf":"https://ijcai.org/proceedings/2017/0728.pdf","markdown":"https://ijcai.org/proceedings/2017/728.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/728","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Journal track","track":"Journal track","number":728,"pages":{"first":5090,"last":5094},"keywords":["Combinatorial & Heuristic Search: Combinatorial search/optimisation","Combinatorial & Heuristic Search: Heuristic Search"],"videos":[],"references":[{"position":1,"raw":"[Bouamama and Blum, 2016] Salim Bouamama and Chris- tian Blum. A hybrid algorithmic model for the minimum weight dominating set problem. Simulation Modelling Practice and Theory, 64:57-68, 2016.","title":"A hybrid algorithmic model for the minimum weight dominating set problem","authors":"Salim Bouamama, Christian Blum","year":"2016","venue":"Simulation Modelling Practice and Theory","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Cai et al., 2011] Shaowei Cai, Kaile Su, and Abdul Sat- tar. Local search with edge weighting and configuration checking heuristics for minimum vertex cover. Artificial Intelligence, 175(9):1672-1696, 2011.","title":"Local search with edge weighting and configuration checking heuristics for minimum vertex cover","authors":"Shaowei Cai, Kaile Su, Abdul Sattar","year":"2011","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Cai et al., 2015] Shaowei Cai, Zhong Jie, and Kaile Su. An effective variable selection heuristic in SLS for weighted Max-2-SAT. Journal of Heuristics, 21(3):433-456, 2015.","title":"An effective variable selection heuristic in SLS for weighted Max-2-SAT","authors":"Shaowei Cai, Zhong Jie, Kaile Su","year":"2015","venue":"Journal of Heuristics","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Chaurasia and Singh, 2015] Sachchida Nand Chaurasia and Alok Singh. A hybrid evolutionary algorithm with guid- ed mutation for minimum weight dominating set. Applied Intelligence, 43(3):512-529, 2015.","title":"Sachchida Nand Chaurasia and Alok Singh. A hybrid evolutionary algorithm with guided mutation for minimum weight dominating set","authors":"Singh Chaurasia","year":"2015","venue":"Applied Intelligence","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Golovach et al., 2013] Petr A Golovach, Pinar Heggernes, Dieter Kratsch, and Yngve Villanger. An incremental polynomial time algorithm to enumerate all minimal edge dominating sets. In Automata, Languages, and Program- ming, pages 485-496. 2013.","title":"An incremental polynomial time algorithm to enumerate all minimal edge dominating sets","authors":"Golovach","year":"2013","venue":"Automata, Languages, and Programming","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Johnson and Trick, 1996] David S Johnson and Michael A Trick. Cliques, coloring, and satisfiability: second DI- MACS implementation challenge, October 11-13, 1993, volume 26. American Mathematical Soc., 1996.","title":"Cliques, coloring, and satisfiability: second DI-MACS implementation challenge","authors":"S David, Michael A Johnson, Trick","year":"1993","venue":null,"doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Jovanovic et al., 2010] Raka Jovanovic, Milan Tuba, and Dana Simian. Ant colony optimization applied to mini- mum weight dominating set problem. In Proceedings of the 12th WSEAS international conference on Automatic control, modelling & simulation, pages 322-326. World Scientific and Engineering Academy and Society, 2010.","title":"Ant colony optimization applied to minimum weight dominating set problem","authors":"Jovanovic","year":"2010","venue":"Proceedings of the 12th WSEAS international conference on Automatic control, modelling & simulation","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Li et al., 2016] Ruizhi Li, Shuli Hu, Haochen Zhang, and Minghao Yin. An efficient local search framework for the minimum weighted vertex cover problem. Information Sciences, 372:428-445, 2016.","title":"An efficient local search framework for the minimum weighted vertex cover problem","authors":"Li","year":"2016","venue":"Information Sciences","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Luo et al., 2015] Chuan Luo, Shaowei Cai, Kaile Su, and Wei Wu. Clause states based configuration checking in local search for satisfiability. Cybernetics, IEEE Transac- tions on, 45(5):1014-1027, 2015.","title":"Clause states based configuration checking in local search for satisfiability","authors":"Chuan Luo, Shaowei Cai, Kaile Su, Wei Wu","year":"2015","venue":"Cybernetics, IEEE Transactions on","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Nitash and Singh, 2014] CG Nitash and Alok Singh. An ar- tificial bee colony algorithm for minimum weight domi- nating set. In Swarm Intelligence (SIS), 2014 IEEE Sym- posium on, pages 1-7. IEEE, 2014.","title":"CG Nitash and Alok Singh. An artificial bee colony algorithm for minimum weight dominating set","authors":"Singh Nitash","year":"2014","venue":"Swarm Intelligence (SIS)","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Potluri and Singh, 2013] Anupama Potluri and Alok Singh. Hybrid meta-heuristic algorithms for minimum weight dominating set. Applied Soft Computing, 13(1):76-88, 2013.","title":"Anupama Potluri and Alok Singh. Hybrid meta-heuristic algorithms for minimum weight dominating set","authors":"Singh Potluri","year":"2013","venue":"Applied Soft Computing","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Rossi and Ahmed, 2015] Ryan Rossi and Nesreen Ahmed. The network data repository with interactive graph analyt- ics and visualization. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, pages 4292- 4293, 2015.","title":"The network data repository with interactive graph analytics and visualization","authors":"Ryan Rossi, Nesreen Ahmed","year":"2015","venue":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Shen and Li, 2010] Chao Shen and Tao Li. Multi-document summarization via the minimum dominating set. In Pro- ceedings of the 23rd International Conference on Compu- tational Linguistics, pages 984-992. Association for Com- putational Linguistics, 2010.","title":"Multi-document summarization via the minimum dominating set","authors":"Li ; ] Chao Shen, Tao Shen, Li","year":"2010","venue":"Proceedings of the 23rd International Conference on Computational Linguistics","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Wang et al., 2016a] Yiyuan Wang, Shaowei Cai, and Ming- hao Yin. Two efficient local search algorithms for maxi- mum weight clique problem. In Proceedings of the Thirti- eth AAAI Conference on Artificial Intelligence, pages 805- 811, 2016.","title":"Two efficient local search algorithms for maximum weight clique problem","authors":"Wang","year":"2016","venue":"Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Wang et al., 2016b] Yiyuan Wang, Minghao Yin, Dantong Ouyang, and Liming Zhang. A novel local search algo- rithm with configuration checking and scoring mechanism for the set k-covering problem. International Transactions in Operational Research, pages 1-23, 2016.","title":"A novel local search algorithm with configuration checking and scoring mechanism for the set k-covering problem","authors":"Wang","year":"2016","venue":"International Transactions in Operational Research","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Wang et al., 2017] Yiyuan Wang, Shaowei Cai, and Ming- hao Yin. Local search for minimum weighted 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 weighted 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":17,"raw":"[Xu et al., 2007] Ke Xu, Frédéric Boussemart, Fred Hemery, and Christophe Lecoutre. Random constraint satisfaction: Easy generation of hard (satisfiable) instances. Artificial Intelligence, 171(8):514-534, 2007.","title":"Random constraint satisfaction: Easy generation of hard (satisfiable) instances","authors":"Ke Xu, Frédéric Boussemart, Fred Hemery, Christophe Lecoutre","year":"2007","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}