An exact solution framework for the minimum cost dominating tree problem
From MaRDI portal
Recommendations
- The minimum dominating tree problem for graphs
- An exact algorithm for multi-constrained minimum spanning tree problem
- Minimum-cost \(b\)-edge dominating sets on trees
- Minimum-cost b-edge dominating sets on trees
- An exact method for solving the bi-objective minimum diameter-cost spanning tree problem
- Models for minimum cost dominating trees
- Exact Algorithms for the Minimum Load Spanning Tree Problem
- Exact solution approaches for the multi-period degree constrained minimum spanning tree problem
- Exact algorithms for finding constrained minimum spanning trees
- Algorithms and Computation
Cites work
- A dual ascent approach for steiner tree problems on a directed graph
- A dual ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems
- A metaheuristic approach to the dominating tree problem
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- An algorithmic framework for the exact solution of tree-star problems
- An exact algorithm for the maximum leaf spanning tree problem.
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- Improved algorithms for the Steiner problem in networks
- Models for minimum cost dominating trees
- Numerical investigation of the new regenerator-recuperator scheme of VOC oxidizer
- On approximation of dominating tree in wireless sensor networks
- The regenerator location problem
- Thinning out Steiner trees: a node-based model for uniform edge costs
Cited in
(4)
This page was built for publication: An exact solution framework for the minimum cost dominating tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1800452)
