An exact exponential time algorithm for POWER DOMINATING SET

Algorithmica

Volumn 63, Issue 1-2, 2012, Pages 323-346

  Binkele Raible, Daniel ^a   Fernau, Henning ^a  

^a UNIVERSITY OF TRIER   (Germany)

Author keywords

Domination type problems; Measure and conquer; Moderately exponential time algorithms; NP hardness results

Indexed keywords

COMPACT REPRESENTATION; CUBIC GRAPH; DOMINATION PROBLEM; DOMINATION-TYPE PROBLEMS; EXPONENTIAL TIME ALGORITHM; GENERAL GRAPH; GRAPH G; MEASURE AND CONQUER; NONLOCAL; NP-HARD; NP-HARDNESS; POLYNOMIAL SPACE; POWER DOMINATING SETS; PROPAGATION RULE; SEARCH TREES; SUBTREES;

ALGORITHMS; FORESTRY; PROBLEM SOLVING;

GRAPH THEORY;

ALGORITHMS; FORESTRY; PROBLEM SOLVING;

EID: 84858862921     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-011-9533-2     Document Type: Article

References (24)

1. Aazami, A., Stilp, K.: Approximation algorithms and hardness for domination with propagation. SIAM J. Discrete Math. 23(3), 1382-1399 (2009
2. Brueni, D.J., Heath, L.S.: The PMU placement problem. SIAM J. DiscreteMath. 19, 744-761 (2006) (Pubitemid 44231251)
3. Chandran, L.S., Grandoni, F.: Refined memorization for vertex cover. Inf. Process. Lett. 93, 125-131 (2005
4. Fernau, H., Raible, D.: Exact algorithms for maximum acyclic subgraph on a superclass of cubic graphs. In: Nakano, S.-I., Rahman, Md.S. (eds.) Workshop on Algorithms and Computation: WALCOM. LNCS, vol. 4921, pp. 144-156. Springer, Berlin (2008
5. Fernau, H., Langer, A., Liedloff,M., Kneis, J., Kratsch, D., Raible, D., Rossmanith, P.: An exact algorithm for the maximum leaf spanning tree problem. In: Chen, J., Fomin, F.V. (eds.) InternationalWorkshop on Parameterized and Exact Computation (IWPEC). LNCS, vol. 5917, pp. 161-172. Springer, Berlin (2009
6. Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Texts in Theoretical Computer Science. Springer, Berlin (2010
7. Fomin, F.V., Grandoni, F., Kratsch, D.: Some new techniques in design and analysis of exact (exponential) algorithms. Technical Report 307, Department of Informatics, University of Bergen (2005
8. Fomin, F.V., Grandoni, F., Kratsch, D.: Solving connected dominating set faster than 2n. Algorithmica 52(2), 153-166 (2008
9. Fomin, F.V., Grandoni, F., Kratsch, D.: A measure & conquer approach for the analysis of exact algorithms. J. ACM 56(5) (2009
10. Garey, M.R., Johnson, D.S.: The rectilinear Steiner tree problem is NP-complete. SIAM J. Appl. Math. 32(4), 826-834 (1977
11. Guo, J., Niedermeier, R., Raible, D.: Improved algorithms and complexity results for power domination in graphs. Algorithmica 52(2), 177-202 (2008
12. Haynes, T.W., Hedetniemi, S.M., Hedetniemi, S.T., Henning, M.A.: Domination in graphs applied to electric power networks. SIAM J. Discrete Math. 15(4), 519-529 (2002 (Pubitemid 35355422)
13. Kneis, J., Mölle, D., Richter, S., Rossmanith, P.: Parameterized power domination complexity. Inf. Process. Lett. 98(4), 145-149 (2006
14. Liao, C.-S., Lee, D.-T.: Power domination problem in graphs. In: Wang, L. (ed.) Computing and Combinatorics, 11th Annual International Conference, COCOON. LNCS, vol. 3595, pp. 818-828. Springer, Berlin (2005 (Pubitemid 41450259)
15. Peng, J., Sun, Y., Wang, H.F.: Optimal PMU placement for full network observability using tabu search algorithm. Int. J. Electr. Power Energy Syst. 28(4), 223-231 (2006
16. Raible, D., Fernau, H.: Power domination in O (1.7548n) using reference search trees. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) Algorithms and Computation, 19th International Symposium, ISAAC 2008. LNCS, vol. 5369, pp. 136-147. Springer, Berlin (2008
17. Raible, D., Fernau, H.: An amortized search tree analysis for k-LEAF SPANNING TREE. In: Van Leeuwen, J., Muscholl, A., Peleg, D., Pokorný, J., Rumpe, B. (eds.) SOFSEM 2010: Theory and Practice of Computer Science. LNCS, vol. 5901, pp. 672-684. Springer, Berlin (2010
18. Robson, J.M.: Algorithms for maximum independent sets. J. Algorithms 7(3), 425-440 (1986
19. Speckenmeyer, E.: On feedback vertex sets and nonseparating independent sets in cubic graphs. J. Graph Theory 3, 405-412 (1988
20. van Rooij, J.M.M., Bodlaender, H.L.: Design by measure and conquer, a faster exact algorithm for dominating set. In: Albers, S., Weil, P. (eds.) Symposium on Theoretical Aspects of Computer Science (STACS), Internationales Begegnungs-und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany. Dagstuhl Seminar Proceedings, vol. 08001, pp. 657-668 (2008
21. van Rooij, J.M.M., Nederlof, J., van Dijk, T.C.: Inclusion/exclusion meets measure and conquer. In: Fiat, A., Sanders, P. (eds.) European Symposium on Algorithms (ESA). LNCS, vol. 5757, pp. 554-565. Springer, Berlin (2009
22. Venugopal, G., Veilumuthu, R., Avila Theresa, P.: Optimal PMU placement and observability of power system using PSAT. In: International Joint Journal Conference on Engineering and Technology (IJJCET10), pp. 67-71 (2010). Available online: Http://ijjcet.com/content.htm
23. Wang, K., Cai, Z., Ding, J.: PMU placement and the state estimation model of a hybrid measurement system
24. Xu, G., Kang, L., Shan, E., Zhao, M.: Power domination in block graphs. Theor. Comput. Sci. 359(1-3), 299-305 (2006 (Pubitemid 44119076)