Restricted swap-based neighborhood search for the minimum connected dominating set problem

DOI10.1002/net.21728zbMath1390.90128OpenAlexW2579139197MaRDI QIDQ4565786

Xinyun Wu, Philippe Galinier, Zhipeng Lü

Publication date: 13 June 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21728

zbMATH Keywords

optimizationtabu searchmeta-heuristicconnected dominating setperturbation operatorswap-based neighborhood structure

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Connectivity (05C40)

Related Items (3)

A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set

This page was built for publication: Restricted swap-based neighborhood search for the minimum connected dominating set problem