An integer programming approach for fault-tolerant connected dominating sets
From MaRDI portal
Recommendations
- The minimum connected dominating set problem: formulation, valid inequalities and a branch-and-cut algorithm
- Solving the connected dominating set problem and power dominating set problem by integer programming
- The k-hop connected dominating set problem: hardness and polyhedra
- Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem
- Approximation algorithms for connected dominating sets
Cited in
(22)- Parsimonious formulations for low-diameter clusters
- A new branch-and-cut approach for the generalized regenerator location problem
- Solving the Distance-Based Critical Node Problem
- False alarms in fault-tolerant dominating sets in graphs
- A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets
- On imposing connectivity constraints in integer programs
- Exact algorithms for the minimum \(s\)-club partitioning problem
- Extended formulations for perfect domination problems and their algorithmic implications
- A matheuristic approach for solving the 2-connected dominating set problem
- Imposing contiguity constraints in political districting models
- The optimal design of low-latency virtual backbones
- Breaking the O(ln n) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set
- A branch-and-Benders-cut approach for the fault tolerant regenerator location problem
- Spanning trees with a constraint on the number of leaves. A new formulation
- Computational approaches for zero forcing and related problems
- Optimal connected subgraphs: Integer programming formulations and polyhedra
- A novel local search approach with connected dominating degree-based incremental neighborhood evaluation for the minimum 2-connected dominating set problem
- A heuristic approach for dividing graphs into bi-connected components with a size constraint
- A note on `Algorithms for connected set cover problem and fault-tolerant connected set cover problem'
- The minimum connected dominating set problem: formulation, valid inequalities and a branch-and-cut algorithm
- Solving the connected dominating set problem and power dominating set problem by integer programming
- Fault-tolerant total domination via submodular function approximation
This page was built for publication: An integer programming approach for fault-tolerant connected dominating sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942693)
