{"type":"ScholarlyArticle","title":"Improving Local Search for Minimum Weight Vertex Cover by Dynamic Strategies","authors":[{"name":"Shaowei Cai","slug":"shaowei-cai","given":"Shaowei","family":"Cai","affiliation":"State Key Laboratory of Computer Science , Institute of Software , Chinese Academy of Sciences; School of Computer and Control Engineering , University of Chinese Academy of Sciences"},{"name":"Wenying Hou","slug":"wenying-hou","given":"Wenying","family":"Hou","affiliation":"School of Information Technology and Management , University of International Business and Economics"},{"name":"Jinkun Lin","slug":"jinkun-lin","given":"Jinkun","family":"Lin","affiliation":"State Key Laboratory of Computer Science , Institute of Software , Chinese Academy of Sciences"},{"name":"Yuanjie Li","slug":"yuanjie-li","given":"Yuanjie","family":"Li","affiliation":"State Key Laboratory of Computer Science , Institute of Software , Chinese Academy of Sciences; School of Computer and Control Engineering , University of Chinese Academy of Sciences"}],"abstract":"The minimum weight vertex cover (MWVC) problem is an important combinatorial optimization problem with various real-world applications. Due to its NP hardness, most works on solving MWVC focus on heuristic algorithms that can return a good quality solution in reasonable time. In this work, we propose two dynamic strategies that adjust the behavior of the algorithm during search, which are used to improve a state of the art local search for MWVC named FastWVC, resulting in two local search algorithms called DynWVC1 and DynWVC2. Previous MWVC algorithms are evaluated on graphs with random or hand crafted weights. In this work, we evaluate the algorithms on the vertex weighted graphs that obtained from an important real world problem, the map labeling problem. Experiments show that our algorithm obtains better results than previous algorithms for MWVC and maximum weight independent set (MWIS) on these real world instances. We also test our algorithms on massive graphs studied in previous works, and show significant improvements there.","doi":"10.24963/ijcai.2018/196","url":"https://ijcai.org/proceedings/2018/196","pdf":"https://ijcai.org/proceedings/2018/0196.pdf","markdown":"https://ijcai.org/proceedings/2018/196.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/196","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Heuristic Search and Game Playing","track":"Main track","number":196,"pages":{"first":1412,"last":1418},"keywords":["Heuristic Search and Game Playing: Combinatorial Search and Optimisation","Heuristic Search and Game Playing: Heuristic Search"],"videos":[],"references":[{"position":1,"raw":"[Andrade et al., 2012] Diogo Vieira Andrade, Mauricio G. C. Resende, and Renato Fonseca F. Werneck. Fast local search for the maximum independent set problem. J. Heuristics, 18(4):525-547, 2012.","title":"Fast local search for the maximum independent set problem","authors":"Diogo Vieira Andrade, Mauricio G C Resende, Renato Fonseca, F Werneck","year":"2012","venue":"J. Heuristics","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Barth et al., 2016] Lukas Barth, Benjamin Niedermann, Martin Nöllenburg, and Darren Strash. Temporal map labeling: a new unified framework with experiments. In Proc. of GIS-2016, pages 23:1-23:10, 2016.","title":"Temporal map labeling: a new unified framework with experiments","authors":"Lukas Barth, Benjamin Niedermann, Martin Nöllenburg, Darren Strash","year":"2016","venue":"Proc. of GIS-2016","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Been et al., 2006] Ken Been, Eli Daiches, and Chee-Keng Yap. Dynamic map labeling. IEEE Trans. Vis. Comput. Graph., 12(5):773-780, 2006.","title":"Dynamic map labeling","authors":"Ken Been, Eli Daiches, Chee-Keng Yap","year":"2006","venue":"IEEE Trans. Vis. Comput. Graph","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Been et al., 2010] Ken Been, Martin Nöllenburg, Sheung-Hung Poon, and Alexander Wolff. Optimizing active ranges for consistent dynamic map labeling. Comput. Geom., 43(3):312-328, 2010.","title":"Optimizing active ranges for consistent dynamic map labeling","authors":"Ken Been, Martin Nöllenburg, Sheung-Hung Poon, Alexander Wolff","year":"2010","venue":"Comput. Geom","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Cai and Lin, 2016] Shaowei Cai and Jinkun Lin. Fast solving maximum weight clique problem in massive graphs. In Proc. of IJCAI 2016, pages 568-574, 2016.","title":"Fast solving maximum weight clique problem in massive graphs","authors":"Lin ; ] Shaowei Cai, Jinkun Cai, Lin","year":"2016","venue":"Proc. of IJCAI 2016","doi":null,"url":null,"internal_url":"/proceedings/2016/87"},{"position":6,"raw":"[Cai et al., 2013] Shaowei Cai, Kaile Su, Chuan Luo, and Abdul Sattar. Numvc: An efficient local search algorithm for minimum vertex cover. J. Artif. Intell. Res., 46:687-716, 2013.","title":"Numvc: An efficient local search algorithm for minimum vertex cover","authors":"Shaowei Cai, Kaile Su, Chuan Luo, Abdul Sattar","year":"2013","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Cai et al., 2017] Shaowei Cai, Jinkun Lin, and Chuan Luo. Finding A small vertex cover in massive sparse graphs: Construct, local search, and preprocess. J. Artif. Intell. Res., 59:463-494, 2017.","title":"Finding A small vertex cover in massive sparse graphs: Construct, local search, and preprocess","authors":"Shaowei Cai, Jinkun Lin, Chuan Luo","year":"2017","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Cai, 2015] Shaowei Cai. Balance between complexity and quality: Local search for minimum vertex cover in massive graphs. In Proc. of IJCAI-2015, pages 747-753, 2015.","title":"Balance between complexity and quality: Local search for minimum vertex cover in massive graphs","authors":"Shaowei Cai","year":"2015","venue":"Proc. of IJCAI-2015","doi":null,"url":null,"internal_url":"/proceedings/2015/111"},{"position":9,"raw":"[Dinur and Safra, 2005] Irit Dinur and Samuel Safra. On the hardness of approximat- ing minimum vertex cover. Annals of Mathematics, 162(1):439-485, 2005.","title":"On the hardness of approximating minimum vertex cover","authors":"Safra Dinur, Irit Dinur, Samuel Safra","year":"2005","venue":"Annals of Mathematics","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Jiang et al., 2017] Hua Jiang, Chu-Min Li, and Felip Manyà. An exact algorithm for the maximum weight clique problem in large graphs. In Proc. of AAAI 2017, pages 830-838, 2017.","title":"An exact algorithm for the maximum weight clique problem in large graphs","authors":"Hua Jiang, Chu-Min Li, Felip Manyà","year":"2017","venue":"Proc. of AAAI 2017","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Jovanovic and Tuba, 2011] Raka Jovanovic and Milan Tuba. An ant colony opti- mization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem. Appl. Soft Comput., 11(8):5360-5366, 2011.","title":"An ant colony optimization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem","authors":"Tuba Jovanovic, Raka Jovanovic, Milan Tuba","year":"2011","venue":"Appl. Soft Comput","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Katzmann and Komusiewicz, 2017] Maximilian Katzmann and Christian Komusiewicz. Systematic exploration of larger local search neighborhoods for the minimum vertex cover problem. In Proc. AAAI 2017, pages 846-852, 2017.","title":"Maximilian Katzmann and Christian Komusiewicz. Systematic exploration of larger local search neighborhoods for the minimum vertex cover problem","authors":"Komusiewicz Katzmann","year":"2017","venue":"Proc. AAAI 2017","doi":null,"url":null,"internal_url":null},{"position":13,"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. Inf. Sci., 372:428-445, 2016.","title":"An efficient local search framework for the minimum weighted vertex cover problem","authors":"Li","year":"2016","venue":"Inf. Sci","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Li et al., 2017] Yuanjie Li, Shaowei Cai, and Wenying Hou. An efficient local search algorithm for minimum weighted vertex cover on massive graphs. In Proc. of SEAL- 2017, pages 145-157, 2017.","title":"An efficient local search algorithm for minimum weighted vertex cover on massive graphs","authors":"Li","year":"2017","venue":"Proc. of SEAL-2017","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Liao et al., 2016] Chung-Shou Liao, Chih-Wei Liang, and Sheung-Hung Poon. Ap- proximation algorithms on consistent dynamic map labeling. Theor. Comput. Sci., 640:84-93, 2016.","title":"Approximation algorithms on consistent dynamic map labeling","authors":"Chung-Shou Liao, Chih-Wei Liang, Sheung-Hung Poon","year":"2016","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[McCreesh et al., 2017] Ciaran McCreesh, Patrick Prosser, Kyle Simpson, and James Trimble. On maximum weight clique algorithms, and how they are evaluated. In Proc. of CP-2017, pages 206-225, 2017.","title":"On maximum weight clique algorithms, and how they are evaluated","authors":"Ciaran Mccreesh, Patrick Prosser, Kyle Simpson, James Trimble","year":"2017","venue":"Proc. of CP-2017","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Pullan, 2009] Wayne Pullan. Optimisation of unweighted/weighted maximum inde- pendent sets and minimum vertex covers. Discrete Optimization, 6(2):214-219, 2009.","title":"Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers","authors":"Wayne Pullan","year":"2009","venue":"Discrete Optimization","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Rossi and Ahmed, 2015] Ryan A. Rossi and Nesreen K. Ahmed. The network data repository with interactive graph analytics and visualization. In Proc. of AAAI-2015, pages 4292-4293, 2015.","title":"The network data repository with interactive graph analytics and visualization","authors":"Ryan A Rossi, Nesreen K Ahmed","year":"2015","venue":"Proc. of AAAI-2015","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Shyu et al., 2004] Shyong Jian Shyu, Peng-Yeng Yin, and Bertrand M. T. Lin. An ant colony optimization algorithm for the minimum weight vertex cover problem. Annals OR, 131(1-4):283-304, 2004.","title":"An ant colony optimization algorithm for the minimum weight vertex cover problem","authors":"Jian Shyong, Peng-Yeng Shyu, Bertrand M T Yin, Lin","year":"2004","venue":"Annals OR","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Tang et al., 2017] C. Tang, A. Li, and X. Li. Asymmetric game: A silver bullet to weighted vertex cover of networks. IEEE Transactions on Cybernetics, PP(99):1- 12, 2017.","title":"Asymmetric game: A silver bullet to weighted vertex cover of networks","authors":"C Tang, A Li, X Li","year":"2017","venue":"IEEE Transactions on Cybernetics","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Tuba and Jovanovic, 2009] Milan Tuba and Raka Jovanovic. An analysis of different variations of ant colony optimization to the minimum weight vertex cover problem. Wseas Transactions on Information Science and Applications, 6(6):3742-56, 2009.","title":"An analysis of different variations of ant colony optimization to the minimum weight vertex cover problem","authors":"Jovanovic Tuba, Milan Tuba, Raka Jovanovic","year":"2009","venue":"Wseas Transactions on Information Science and Applications","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Voß and Fink, 2012] Stefan Voß and Andreas Fink. A hybridized tabu search approach for the minimum weight vertex cover problem. J. Heuristics, 18(6):869- 876, 2012.","title":"A hybridized tabu search approach for the minimum weight vertex cover problem","authors":"Fink Voß, Stefan Voß, Andreas Fink","year":"2012","venue":"J. Heuristics","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Wang et al., 2016] Yiyuan Wang, Shaowei Cai, and Minghao Yin. Two efficient local search algorithms for maximum weight clique problem. In Proc. of AAAI 2016, pages 805-811, 2016.","title":"Two efficient local search algorithms for maximum weight clique problem","authors":"Wang","year":"2016","venue":"Proc. of AAAI 2016","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Zhou et al., 2016] Taoqing Zhou, Zhipeng Lü, Yang Wang, Junwen Ding, and Bo Peng. Multi-start iterated tabu search for the minimum weight vertex cover problem. J. Comb. Optim., 32(2):368-384, 2016.","title":"Multi-start iterated tabu search for the minimum weight vertex cover problem","authors":"Taoqing Zhou, Zhipeng Lü, Yang Wang, Junwen Ding, Bo Peng","year":"2016","venue":"J. Comb. Optim","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}