Abstract
The connected dominating set (CDS) problem is a well studied NP-hard problem with many important applications. Dorn et al. [ESA2005, LNCS3669,pp95-106] introduce a new technique to generate \(2^{O(\sqrt{n})}\) time and fixed-parameter algorithms for a number of non-local hard problems, including the CDS problem in planar graphs. The practical performance of this algorithm is yet to be evaluated. We perform a computational study for such an evaluation. The results show that the size of instances can be solved by the algorithm mainly depends on the branchwidth of the instances, coinciding with the theoretical result. For graphs with small or moderate branchwidth, the CDS problem instances with size up to a few thousands edges can be solved in a practical time and memory space. This suggests that the branch-decomposition based algorithms can be practical for the planar CDS problem.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Library of Efficient Data Types and Algorithms, Version 5.2 (2008), http://www.algorithmic-solutions.com/enleda.htm
Public Implementation of a Graph Algorithm Library and Editor (2008), http://pigale.sourceforge.net/
The LEDA User Manual, Algorithmic Solutions, Version 4.2.1 (2008), http://www.mpi-inf.mpg.de/LEDA/MANUAL/MANUAL.html
Bian, Z., Gu, Q.: Computing branch decompositions of large planar graphs. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 87–100. Springer, Heidelberg (2008)
Blum, J., Ding, M., Thaeler, A., Cheng, X.: Connected dominating set in sensor networks and MANETs. In: Du, D.-Z., Pardalos, P. (eds.) Handbooks of Combinatorial Optimization, Suppl., vol. B, pp. 329–369. Springer, Heidelberg (2004)
Cheng, X., Ding, M., Du, H., Jia, X.: Virtual backbone construction in multihop Ad Hoc wireless networks. Wireless Communications and Mobile Computing 6(2), 183–190 (2006)
Demaine, E.D., Hajiaghayi, M.: Bidimensionality: new connections between FPT algorithms and PTAS. In: Proc. of the 2005 ACM/SIAM Symposium on Discrete Algorithms (SODA 2005), pp. 590–601 (2005)
Dorn, F.: Dynamic programming and fast matrix multiplication. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 280–291. Springer, Heidelberg (2006)
Dorn, F., Penninkx, E., Bodlaender, H.L., Fomin, F.V.: Efficient exact algorithms on planar graphs: exploiting sphere cut branch decompositions. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 95–106. Springer, Heidelberg (2005)
Dorn, F., Penninkx, E., Bodlaender, H.L., Fomin, F.V.: Efficient exact algorithms on planar graphs: exploiting sphere cut decompositions. Technical report, UU-CS-2006-006, Department of Information and Computing Sciences (2006)
Downey, R.G., Fellow, M.R.: Parameterized complexity. In: Monographs in Computer Science. Springer, Heidelberg (1999)
Downey, R.G., Fellows, M.R.: Fixed parameter tractability and completeness. Cong. Num. 87, 161–187 (1992)
Fomin, F.V., Thilikos, D.M.: Dominating sets in planar graphs: branch-width and exponential speed-up. SIAM Journal on Computing 36(2), 281–309 (2006)
Fomin, F.V., Thilikos, D.M.: New upper bounds on the decomposability of planar graphs. Journal of Graph Theory 51(1), 53–81 (2006)
Garey, M.R., Johnson, D.S.: Computers and Intractability, a Guide to the Theory of NP-Completeness. Freeman, New York (1979)
Gu, Q., Imani, N.: Connectivity is not a limit for kernelization: planar connected dominating set. In: López-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 26–37. Springer, Heidelberg (2010)
Gu, Q., Tamaki, H.: Optimal branch-decomposition of planar graphs in O(n 3) time. ACM Transactions on Algorithms 4(3), 30:1–30:13 (2008)
Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmca 20, 374–387 (1998)
Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in graphs. In: Monographs and Textbooks in Pure and Applied Mathematics, vol. 209. Marcel Dekker, New York (1998)
Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of domination in graphs. In: Monographs and Textbooks in Pure and Applied Mathematics, vol. 208. Marcel Dekker, New York (1998)
Marzban, M., Gu, Q., Jia, X.: Computational study on planar dominating set problem. Theoretical Computer Science 410(52), 5455–5466 (2009)
Reinelt, G.: TSPLIB-A traveling salesman library. ORSA J. on Computing 3, 376–384 (1991)
Robertson, N., Seymour, P.D.: Graph minors I. Excluding a forest. Journal of Combinatorial Theory, Series B 35, 39–61 (1983)
Robertson, N., Seymour, P.D.: Graph minors II. Algorithmic aspects of tree-width. Journal of Algorithms 7, 309–322 (1986)
Robertson, N., Seymour, P.D.: Graph minors X. Obstructions to tree decomposition. J. of Combinatorial Theory, Series B 52, 153–190 (1991)
Seymour, P.D., Thomas, R.: Call routing and the ratcatcher. Combinatorica 14(2), 217–241 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Marzban, M., Gu, QP., Jia, X. (2010). Computational Study for Planar Connected Dominating Set Problem. In: Wu, W., Daescu, O. (eds) Combinatorial Optimization and Applications. COCOA 2010. Lecture Notes in Computer Science, vol 6509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17461-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-17461-2_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17460-5
Online ISBN: 978-3-642-17461-2
eBook Packages: Computer ScienceComputer Science (R0)