Pages that link to "Item:Q2942693"
From MaRDI portal
The following pages link to An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets (Q2942693):
Displaying 20 items.
- A note on `Algorithms for connected set cover problem and fault-tolerant connected set cover problem' (Q653341) (← links)
- A new branch-and-cut approach for the generalized regenerator location problem (Q827283) (← links)
- Computational approaches for zero forcing and related problems (Q1631510) (← links)
- Spanning trees with a constraint on the number of leaves. A new formulation (Q1652247) (← links)
- On imposing connectivity constraints in integer programs (Q1683690) (← links)
- Parsimonious formulations for low-diameter clusters (Q2220903) (← links)
- A branch-and-Benders-cut approach for the fault tolerant regenerator location problem (Q2289917) (← links)
- Exact algorithms for the minimum \(s\)-club partitioning problem (Q2329904) (← links)
- A heuristic approach for dividing graphs into bi-connected components with a size constraint (Q2403269) (← links)
- False alarms in fault-tolerant dominating sets in graphs (Q4908866) (← links)
- A matheuristic approach for solving the 2-connected dominating set problem (Q4989008) (← links)
- Imposing Contiguity Constraints in Political Districting Models (Q5080650) (← links)
- A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets (Q5085993) (← links)
- Solving the Distance-Based Critical Node Problem (Q5087707) (← links)
- Breaking the <i>O</i>(ln <i>n</i>) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set (Q5131722) (← links)
- The Optimal Design of Low-Latency Virtual Backbones (Q5148180) (← links)
- Optimal connected subgraphs: Integer programming formulations and polyhedra (Q6064164) (← links)
- Fault-tolerant total domination via submodular function approximation (Q6111966) (← links)
- Extended formulations for perfect domination problems and their algorithmic implications (Q6113358) (← links)
- A novel local search approach with connected dominating degree-based incremental neighborhood evaluation for the minimum 2-connected dominating set problem (Q6645156) (← links)
