Abstract
AbstractWe consider Upper Domination, the problem of finding the minimal dominating set of maximum cardinality. Very few exact algorithms have been described for solving Upper Domination. In particular, no binary programming formulations for Upper Domination have been described in literature, although such formulations have proved quite successful for other kinds of domination problems. We introduce two such binary programming formulations, and show that both can be improved with the addition of extra constraints which reduce the number of feasible solutions. We compare the performance of the formulations on various kinds of graphs, and demonstrate that (a) the additional constraints improve the performance of both formulations, and (b) the first formulation outperforms the second in most cases, although the second performs better for very sparse graphs. Also included is a short proof that the upper domination number of any generalized Petersen graph P(n, k) is equal to n.
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Mathematics,Software
Reference26 articles.
1. Alanko S, Crevals S, Isopoussu A, Östergård P, Pettersson V (2011) Computing the domination number of grid graphs. Electron. J. Comb. 18(1):P141
2. Bazgan C, Brankovic L, Casel K, Fernau H, Jansen K, Klein KM, Lampis M, Liedloff M, Monnot J, Paschos VT (2018) The many facets of upper domination. Theoret. Comput. Sci. 717:2–25
3. Burcroff A (2021) Tightness of domination inequalities for direct product graphs. Discret. Math. 344(9):112495
4. Burdett R, Haythorpe M (2020) An improved binary programming formulation for the secure domination problem. Ann. Oper. Res. 295:561–573
5. Burdett R, Haythorpe M, Newcombe A (2021) Variants of the domination number for flower snarks, Arxiv preprint, arXiv:2110.01838