A novel local search approach with connected dominating degree-based incremental neighborhood evaluation for the minimum 2-connected dominating set problem
From MaRDI portal
Publication:6645156
DOI10.1007/S10878-024-01175-1MaRDI QIDQ6645156
Caiquan Xiong, Xinyun Wu, Mao Luo, Huigang Qin
Publication date: 28 November 2024
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
combinatorial optimizationlocal searchmeta-heuristicincremental neighborhood evaluationminimum 2-connected dominating set
Cites Work
- Distributed minimum dominating set approximations in restricted families of graphs
- Reformulations and solution algorithms for the maximum leaf spanning tree problem
- Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems
- An improved exact algorithm for minimum dominating set in chordal graphs
- A polylogarithmic approximation algorithm for 2-edge-connected dominating set
- An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets
- Restricted swap-based neighborhood search for the minimum connected dominating set problem
- A matheuristic approach for solving the 2-connected dominating set problem
- A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem
This page was built for publication: A novel local search approach with connected dominating degree-based incremental neighborhood evaluation for the minimum 2-connected dominating set problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6645156)
