An exact solution framework for the minimum cost dominating tree problem
The minimum cost dominating tree problem is a recently introduced NP-hard problem, which consists of finding a tree of minimal cost in a given graph, such that for every node of the graph, the node or one of its neighbours is in the tree. We present an exact solution framework combining a primal–dual heuristic with a branch-and-cut approach based on a transformation of the problem into a Steiner arborescence problem with an additional constraint. The effectiveness of our approach is evaluated on testbeds proposed in literature containing instances with up to 500 nodes. Our framework manages to solve all but four instances from literature to proven optimality within 3 h (most of them in a few seconds). We provide optimal solution values for 69 instances from literature for which the optimal solution was previously unknown.
KeywordsDominating tree Primal–dual heuristic Branch-and-cut
E.A.-M. acknowledges the support of the Chilean Council of Scientific and Technological Research, CONICYT, through the Grant FONDECYT N.1180670 and through the Complex Engineering Systems Institute (ICM-FIC:P-05-004-F, CONICYT:FB0816). The research of M.S. was supported by the Austrian Research Fund (FWF, Project P 26755-N19). M.L. acknowledges the support of the University of Vienna through the uni:docs fellowship programme.
- 8.Leitner, M., Ljubić, I., Luipersbeck, M., Sinnl, M.: A dual-ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems. INFORMS J. Comput. (to appear)Google Scholar
- 10.Ore, O.: Theory of Graphs, Volume 38 of Colloquium Publications, 1st edn. American Mathematical Society, Providence (1962)Google Scholar
- 17.Zhang, N., Shin, I., Li, B., Boyaci, C., Tiwari, R., Thai, M.: New approximation for minimum-weight routing backbone in wireless sensor network. In: Li, Y., Huynh, D., Das, S., Du, D. (eds.) Proceedings of WASA 2008, Volume 5258 of LNCS, pp. 96–108. Springer, Berlin (2008)Google Scholar