Computational study on planar dominating set problem

Theoretical Computer Science

Volumn 410, Issue 52, 2009, Pages 5455-5466

  Marzban, Marjan ^a   Gu, Qian Ping ^a   Jia, Xiaohua ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Branch decomposition; Computational study; Data reduction; Fixed parameter algorithms; PLANAR DOMINATING SET

Indexed keywords

BRANCH-DECOMPOSITION; BRANCHWIDTH; COMPUTATIONAL RESULTS; COMPUTATIONAL STUDIES; COMPUTATIONAL STUDY; DOMINATING SET PROBLEMS; FIXED-PARAMETER ALGORITHMS; MEMORY SPACE; PLANAR DOMINATING SET; PLANAR GRAPH;

ALGORITHMS; DATA REDUCTION; SET THEORY; STATISTICS; TRANSIENTS;

GRAPH THEORY;

EID: 70350570591     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.04.012     Document Type: Article

References (44)

1. Public Implementation of a Graph Algorithm Library and Editor. http://pigale.sourceforge.net/, 2008
2. The LEDA User Manual, Algorithmic Solutions, Version 4.2.1. http://www.mpi-inf.mpg.de/LEDA/MANUAL/MANUAL.html, 2008
3. J. Alber, N. Betzler, R. Niedermeier, Experiments on data reduction for optimal domination in networks, in: Proc. of the International Network Optimization Conference, INOC2003, 2003, pp. 1-6
4. Alber J., Bodlaender H.L., Fernau H., Kloks T., and Niedermeier R. Fixed parameter algorithms for dominating set and related problems on planar graphs. Algorithmca 33 (2002) 461-493
5. J. Alber, F. Dorn, R. Niedermeier, Experiments on optimally soving NP-complete problems on planar graphs. Manuscript, http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.23.4973&rep=rep1&type=pdf
6. Alber J., Dorn F., and Niedermeier R. Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs. Discrete Applied Mathematics 145 2 (2005) 219-231
7. Alber J., Fan H., Fellows M., Fernau H., and Niedermeier R. Refined search tree technique for dominating set on planar graphs. Proc. of the 26th Mathematical Foundations of Computer Science. MFCS2001. LNCS vol. 2136 (2001) 111-122
8. Alber J., Fellows M.R., and Niedermeier R. Polynomial time data reduction for dominating set. Journal of the ACM 51 3 (2004) 363-384
9. Baker B.S. Approximation algorithms for NP-complete problems on planar graphs. Journal of ACM 41 (1994) 153-180
10. Bian Z., and Gu Q. Computing branch decompositions of large planar graphs. Proc. of the 7th International Workshop on Experimental Algorithms. WEA 2008. LNCS vol. 5038 (2008) 87-100
11. Z. Bian, Q. Gu, M. Marzban, H. Tamaki, Y. Yoshitake, Empirical study on branchwidth and branch decomposition of planar graphs, in: Proc. of the 9th SIAM Workshop on Algorithm Engineering and Experiments, ALENEX'08, 2008, pp. 152-165
12. Coppersmith D., and Winograd S. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation 9 (1990) 251-280
13. Demaine E.D., Fomin F.V., Hajiaghayi M.T., and Thilikos D.M. Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. Journal of ACM 52 6 (2005) 866-893
14. Demaine E.D., and Hajiaghayi M.T. The bidimensionality thoery and its algorithmic applications. Computer Journal 51 3 (2008) 292-302
15. Dorn F. Dynamic programming and fast matrix multiplication. Proc. of the 14th Annual European Symposium on Algorithms. ESA2006. LNCS vol. 4168 (2006) 280-291
16. Dorn F. How to use planarity efficiently: New tree-decomposition based algorithms. Proc. of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science. WG2007. LNCS vol. 4769 (2007) 280-291
17. F. Dorn, F.V. Fomin, D.M. Thilikos, Catalan structures and dynamic programming in H-minor-free graphs, in: Proc. of 2008 ACM/SIAM Symposium on Discrete Algorithms, SODA08, 2008, pp. 631-640
18. Dorn F., Fomin F.V., and Thilikos D.M. Subexponential parameterized algorithms. Computer Science Review 2 1 (2008) 29-39
19. Dorn F., Penninkx E., Bodlaender H., and Fomin F.V. Efficient exact algorithms for planar graphs: Exploiting sphere cut branch decompositions. Proc. of the 13th Annual European Symposium on Algorithms. ESA05. LNCS vol. 3669 (2005) 95-106
20. Downey R.G., and Fellow M.R. Parameterized complexity. Monographs in Computer Science (1999), Springer-Verlag
21. Downey R.G., and Fellows M.R. Fixed parameter tractability and completeness. Congressus Numerantium 87 (1992) 161-187
22. Fiege U. A threshold of ln n for approximating set cover. Journal of ACM 45 (1998) 634-652
23. Fomin F.V., and Thilikos D.M. Dominating sets in planar graphs: Branch-width and exponential speed-up. SIAM Journal on Computing 36 2 (2006) 281-309
24. Fomin F.V., and Thilikos D.M. New upper bounds on the decomposability of planar graphs. Journal of Graph Theory 51 1 (2006) 53-81
25. Garey M.R., and Johnson D.S. Computers and Intractability, a Guide to the Theory of NP-Completeness (1979), Freeman, New York
26. 3) time. ACM Transactions on Algorithms 4 3 (2008) 30:1-30:13
27. Haynes T.W., Hedetniemi S.M., Hedetniemi S.T., and Henning M.A. Domination in graphs applied to electronic power networks. SIAM Journal on Discrete Mathematics 15 4 (2002) 519-529
28. Haynes T.W., Hedetniemi S.T., and Slater P.J. Domination in graphs. Monographs and Textbooks in Pure and Applied Mathematics vol. 209 (1998), Marcel Dekker
29. Haynes T.W., Hedetniemi S.T., and Slater P.J. Fundamentals of domination in graphs. Monographs and Textbooks in Pure and Applied Mathematics vol. 208 (1998), Marcel Dekker
30. Johnson D.S. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences 9 (1974) 256-278
31. Kanj I.A., and Perkovic L. Improved parameterized algorithms for planar dominating set. Proc. of the 27th MFCS. LNCS vol. 2420 (2002) 399-410
32. Li X.-Y. Algorithmic, geometric and graphs issues in wireless networks. Journal of Wireless Communications and Mobile Computing (WCMC) 6 2 (2003) 119-140
33. Marzban M., Gu Q., and Jia X. Computational study on dominating set problem of planar graphs. Proc. of the 2nd International Conference on Combinatorial Optimization and Applications. COCOA 2008. LNCS vol. 5165 (2008) 89-102
34. Mehlhorn K., and Näher S. LEDA: A Platform for Combinatorial and Geometric Computing (1999), Cambridge University Press, New York
35. Reinelt G. TSPLIB-A traveling salesman library. ORSA Journal on Computing 3 (1991) 376-384
36. Robertson N., and Seymour P.D. Graph minors I. Excluding a forest. Journal of Combinatorial Theory, Series B 35 (1983) 39-61
37. Robertson N., and Seymour P.D. Graph minors II. Algorithmic aspects of tree-width. Journal of Algorithms 7 (1986) 309-322
38. Robertson N., and Seymour P.D. Graph minors X. Obstructions to tree decomposition. Journal of Combinatorial Theory, Series B 52 (1991) 153-190
39. Sanchis L.A. Experimental analysis of heuristic algorithms for the dominating set problem. Algorithmica 33 (2002) 3-18
40. G. Schaeffer, Random sampling of large planar maps and convex polyhedra, in: Proc. of the 31st Annual ACM Symposium on the Theory of Computing, STOC'99, 1999, pp. 760-769
41. Seymour P.D., and Thomas R. Call routing and the ratcatcher. Combinatorica 14 2 (1994) 217-241
42. Wan P.J., Alzoubi K.M., and Frieder O. A simple heuristic for minimum connected dominating set in graphs. International Journal of Foundations on Computer Science 14 2 (2003) 323-333
43. West D.B. Introduction to Graph Theory (1996), Prentice Hall Inc., Upper Saddle River, NJ
44. Zwick U. All pairs shortest paths using bridging sets and rectangular matrix multiplication. Journal of ACM 49 (2002) 289-317