A hybrid population-based algorithm for solving the minimum dominating set problem
From MaRDI portal
Recommendations
- Restricted swap-based neighborhood search for the minimum connected dominating set problem
- Integer linear programming models and greedy heuristic for the minimum weighted independent dominating set problem
- An iterated greedy algorithm for finding the minimum dominating set in graphs
- A novel local search approach with connected dominating degree-based incremental neighborhood evaluation for the minimum 2-connected dominating set problem
- A rough-set based solution of the total domination problem
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A SIMPLE HEURISTIC FOR MINIMUM CONNECTED DOMINATING SET IN GRAPHS
- A dominating-set-based routing scheme in ad hoc wireless networks
- A faster algorithm for dominating set analyzed by the potential method
- Analysis of a greedy heuristic for finding small dominating sets in graphs
- Experimental analysis of Heuristic algorithms for the dominating set problem
- On the approximability of positive influence dominating set in social networks
- Statistical comparisons of classifiers over multiple data sets
Cited in
(1)
This page was built for publication: A hybrid population-based algorithm for solving the minimum dominating set problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6617729)
