Approximation algorithms and hardness for domination with propagation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4627 LNCS, Issue , 2007, Pages 1-15

  Aazami, Ashkan ^a   Stilp, Michael D ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b Georgia Institute of Technology   (United States)

Author keywords

Approximation algorithms; Dominating set; Greedy algorithms; Hardness of approximation; Integer programming; Planar graphs; Power dominating set; PTAS

Indexed keywords

APPROXIMATION ALGORITHMS; GRAPH THEORY; INTEGER PROGRAMMING; NUMERICAL METHODS; PROBLEM SOLVING;

DOMINATING SETS; GREEDY ALGORITHMS; HARDNESS OF APPROXIMATION; PLANAR GRAPHS; POWER DOMINATING SET (PDS) PROBLEM;

SET THEORY;

EID: 38049080711     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74208-1_1     Document Type: Conference Paper

References (26)

1. Aazami, A.: Domination in graphs with bounded propagation: algorithms, formulations and hardness results ( manuscript, submitted to a journal)
2. Aazami, A., Stilp, M.D.: Approximation algorithms and hardness for domination with propagation ( manuscript, submitted to a journal)
3. Alber, J., Bodlaender, H.L., Fernau, H., Kloks, T., Niedermeier, R.: Fixed parameter algorithms for dominating set and related problems on planar graphs. Algorithmica 33(4), 461-493 (2002)
4. Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41(1), 153-180 (1994)
5. Baldwin, T.L., Mili, L., Boisen, M.B.J., Adapa, R.: Power system observability with minimal phasor measurement placement. IEEE Trans. Power Syst 8(2), 707-715 (1993)
6. Bhargava, B.: Synchronized phasor measurement system project at Southern California Edison Co. Power Engineering Society Summer Meeting 1, 16-22 (1999)
7. Bodlaender, H.L., Gilbert, J.R., Hafsteinsson, H., Kloks, T.: Approximating treewidth, pathwidth, frontsize, and shortest elimination tree. J. Algorithms 18(2), 238-255 (1995)
8. Brueni, D.J.: Minimal PMU placement for graph observability, a decomposition approach. Masters thesis, Virginia Polytechnic Institute and State University, Blacksburg, VA (1993)
9. Brueni, D.J., Heath, L.S.: The PMU placement problem. SIAM J. Discret. Math. 19(3), 744-761 (2005)
10. Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique width. In: Workshop on Graph-Theoretic Concepts in Computer Science, pp. 1-16 (1998)
11. Demaine, E.D., Hajiaghayi, M.: Bidimensionality: new connections between FPT algorithms and PTASs. In: SODA, Philadelphia, PA, USA, pp. 590-601 (2005)
12. Feige, U.: A threshold of In n for approximating set cover. J. ACM 45(4), 634-652 (1998)
13. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA (1979)
14. Guo, J., Niedermeier, R., Raible, D.: Improved algorithms and complexity results for power domination in graphs. In: Liśkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol. 3623, pp. 172-184. Springer, Heidelberg (2005)
15. 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)
16. Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in graphs. Marcel Dekker (1998)
17. Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker (1998)
18. Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9(3), 256-278 (1974)
19. Kneis, J., Mölle, D., Richter, S., Rossmanith, P.: Parameterized power domination complexity. Inf. Process. Lett. 98(4), 145-149 (2006)
20. Kortsarz, G., Krauthgamer, R., Lee, J.R.: Hardness of approximation for vertex-connectivity network design problems. SIAM J. Comput. 33(3), 704-720 (2004)
21. Lovász, L.: On the ratio of optimal integral and fractional covers. Discrete Mathematics 13, 383 390 (1975)
22. Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. J. ACM 41(5), 960-981 (1994)
23. Martin, K.E.: Phasor measurements at the Bonneville Power Administration. Power Systems and Communications Infrastructures for the Future (September 2002)
24. Mili, L., Baldwin, T.L., Phadke, A.: Phasor measurements for voltage and transient stability monitoring and control. In: Proceedings of the EPRI-NSF Workshop on Application of Advanced Mathematics to Power Systems (1991)
25. Nuqui, R.F.: State Estimation and Voltage Security Monitoring Using Synchronized Phasor Measurements. PhD thesis, Virginia Polytechnic Institute and State University(July 2001)
26. Phadke, A.: Synchronized phasor measurements - a historical overview. Transmission and Distribution Conference and Exhibition 1, 476 479 (2002)