A matheuristic approach for solving the 2-connected dominating set problem
DOI10.2298/AADM190227052JzbMATH Open1488.90221OpenAlexW3111269231MaRDI QIDQ4989008FDOQ4989008
Authors: Raka Jovanovic, Stefan Voß 
Publication date: 20 May 2021
Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/aadm190227052j
Recommendations
- Restricted swap-based neighborhood search for the minimum connected dominating set problem
- A decomposition approach for the minimum connected dominating set problem
- Approximation algorithms for connected dominating sets
- A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem
- Approximation algorithms for connected dominating sets
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Randomized algorithms (68W20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Mixed integer programming (90C11)
Cites Work
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
- A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing
- Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem
- Total roman domination in graphs
- On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs
- On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks
- On the construction of \(k\)-connected \(m\)-dominating sets in wireless networks
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- An integer programming approach for fault-tolerant connected dominating sets
- On connected dominating sets of restricted diameter
- A heuristic approach for dividing graphs into bi-connected components with a size constraint
- Perfect and quasiperfect domination in trees
Cited In (5)
- A decomposition approach for the minimum connected dominating set problem
- Heuristics for \(k\)-domination models of facility location problems in street networks
- A novel local search approach with connected dominating degree-based incremental neighborhood evaluation for the minimum 2-connected dominating set problem
- Title not available (Why is that?)
- Restricted swap-based neighborhood search for the minimum connected dominating set problem
Uses Software
This page was built for publication: A matheuristic approach for solving the 2-connected dominating set problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4989008)
