License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CP.2021.39
URN: urn:nbn:de:0030-drops-153304
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/15330/
Li, Bohan ;
Wang, Kai ;
Wang, Yiyuan ;
Cai, Shaowei
Improving Local Search for Minimum Weighted Connected Dominating Set Problem by Inner-Layer Local Search
Abstract
The minimum weighted connected dominating set (MWCDS) problem is an important variant of connected dominating set problems with wide applications, especially in heterogenous networks and gene regulatory networks. In the paper, we develop a nested local search algorithm called NestedLS for solving MWCDS on classic benchmarks and massive graphs. In this local search framework, we propose two novel ideas to make it effective by utilizing previous search information. First, we design the restart based smoothing mechanism as a diversification method to escape from local optimal. Second, we propose a novel inner-layer local search method to enlarge the candidate removal set, which can be modelled as an optimized version of spanning tree problem. Moreover, inner-layer local search method is a general method for maintaining the connectivity constraint when dealing with massive graphs. Experimental results show that NestedLS outperforms state-of-the-art meta-heuristic algorithms on most instances.
BibTeX - Entry
@InProceedings{li_et_al:LIPIcs.CP.2021.39,
author = {Li, Bohan and Wang, Kai and Wang, Yiyuan and Cai, Shaowei},
title = {{Improving Local Search for Minimum Weighted Connected Dominating Set Problem by Inner-Layer Local Search}},
booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)},
pages = {39:1--39:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-211-2},
ISSN = {1868-8969},
year = {2021},
volume = {210},
editor = {Michel, Laurent D.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/15330},
URN = {urn:nbn:de:0030-drops-153304},
doi = {10.4230/LIPIcs.CP.2021.39},
annote = {Keywords: Operations Research, NP-hard Problem, Local Search, Weighted Connected Dominating Set Problem}
}
Keywords: |
|
Operations Research, NP-hard Problem, Local Search, Weighted Connected Dominating Set Problem |
Collection: |
|
27th International Conference on Principles and Practice of Constraint Programming (CP 2021) |
Issue Date: |
|
2021 |
Date of publication: |
|
15.10.2021 |
Supplementary Material: |
|
Software (Source Code): https://github.com/DouglasLee001/NestedLS |