Abstract
A minimum dominating set (MDS) of a simple undirected graph G is a dominating set with the smallest possible cardinality among all dominating sets of G and the MDS problem represents the problem of finding the MDS in a given input graph.
Motivated by the transportation, social and biological networks from a control theory perspective, the main result of this paper is the assertion that a random sampling is usable to find a near-optimal dominating set in an arbitrary connected graph. Our result might be of significance in particular contexts where exact algorithms cannot be run, e.g. in distributed computation environments. Moreover, the analysis of the relationship between the time complexity and the approximation ratio of the corresponding sequential algorithm exposes the counterintuitive behavior.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
For the time complexity, it is used a modified big-Oh notation \(O^*\) throughout this paper. For functions f and g, we write \(f(n) = O^*(g(n))\) if \(f(n) = O(g(n)poly(n))\), where poly(n) is a polynomial.
- 2.
We use the Stirling’s formula in the form \(n! \approx \sqrt{2 \pi n}(n/e)^n\).
References
Chen, Y.P., Liestman, A.L.: Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks. In: Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking & Computing MobiHoc 2002, pp. 165–172. ACM, New York (2002)
Cooper, C., Klasing, R., Zito, M.: Lower bounds and algorithms for dominating sets in web graphs. Internet Math. 2(3), 275–300 (2005)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)
Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, New York (1979)
Gast, M., Hauptmann, M., Karpinski, M.: Inapproximability of dominating set in power law graphs. Theor. Comput. Sci. 562, 436–452 (2015)
Gomes, C.P., Williams, R.: Approximation algorithms. In: Burke, E., Kendall, G. (eds.) Introduction to Optimization, Decision Support and Search Methodologies, pp. 557–585. Kluwer, Dordrecht (2005)
Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker Inc., New York (1998)
Hooker, J.N., Garfinkel, R.S., Chen, C.K.: Finite dominating sets for network location problems. Oper. Res. 39(1), 100–118 (1991). http://www.jstor.org/stable/171492. INFORMS
Hromkovič, J.: Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms. Springer, Heidelberg (2005)
Kelleher, L., Cozzens, M.: Dominating sets in social network graphs. Math. Soc. Sci. 16, 267–279 (1988)
Kratsch, D., Fomin, F.V., Grandoni, F.: Exact algorithms for dominating set. In: Kao, M.-Y. (ed.) Encyclopedia of Algorithms, pp. 1–5. Springer, New York (2008)
Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, New York (1995)
Nacher, J.C., Akutsu, T.: Analysis on critical nodes in controlling complex networks using dominating sets. In: Proceedings of the International Conference on Signal-Image Technology & Internet-Based Systems, pp. 649–654. IEEE Computer Society Press (2013)
Nehéz, M., Bernát, D., Klaučo, M.: Comparison of algorithms for near-optimal dominating sets computation in real-world networks. In: Proceedings of the 16th International Conference on Computer Systems and Technologies, pp. 199–206. ACM, New York (2015)
Nikoletseas, S.E., Spirakis, P.G.: Near-optimal dominating sets in dense random graphs in polynomial expected time. In: van Leeuwen, J. (ed.) WG 1993. LNCS, vol. 790, pp. 1–10. Springer, Heidelberg (1994)
Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proceedings of the 29th Annual ACM Symposium on the Theory of Computing STOC 1997, pp. 475–484. ACM, New York (1997)
van Rooij, J.M.M., Bodlaender, H.L.: Exact algorithms for dominating set. Discrete Appl. Math. 159(17), 2147–2164 (2011)
Wang, H., Zheng, H., Browne, F., Wang, C.: Minimum dominating sets in cell cycle specific protein interaction network. In: Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, pp. 25–30. IEEE Computer Society Press (2014)
Wuchty, S.: Controllabilty in protein interaction networks. Proc. Natl. Acad. Sci. USA 111(9), 7156–7160 (2014)
Acknowledgement
The author gratefully acknowledge prof. J. Hromkovič and M. Demetrian for their valuable comments on the manuscript.
This research is supported by the MESRS of the Slovak Republic under the grants KEGA 047STU-4/2016 and VEGA 1/0026/16, respectively.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Nehéz, M. (2016). Near-Optimal Dominating Sets via Random Sampling. In: Dondi, R., Fertin, G., Mauri, G. (eds) Algorithmic Aspects in Information and Management. AAIM 2016. Lecture Notes in Computer Science(), vol 9778. Springer, Cham. https://doi.org/10.1007/978-3-319-41168-2_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-41168-2_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-41167-5
Online ISBN: 978-3-319-41168-2
eBook Packages: Computer ScienceComputer Science (R0)