Domination in graphs with bounded propagation: algorithms, formulations and hardness results

Aazami A (2008) Domination in graphs with bounded propagation: algorithms, formulations and hardness results. Manuscript (available on arXiv: 0802.2130v1 )

Aazami A, Stilp MD (2006) Approximation algorithms and hardness for domination with propagation. 22 pages, Submitted to a journal (avaiable on arXiv: 0710.2139v1 )

Aazami A, Stilp MD (2007) Approximation algorithms and hardness for domination with propagation. In: Proceedings of the 10th international workshop on approximation algorithms for combinatorial optimization problems. LNCS, vol 4627. Springer, Berlin, pp 1–15

Alber J, Bodlaender HL, Fernau H, Kloks T, Niedermeier R (2002) Fixed parameter algorithms for dominating set and related problems on planar graphs. Algorithmica 33(4):461–493

Baker BS (1994) Approximation algorithms for NP-complete problems on planar graphs. J ACM 41(1):153–180

Baldwin TL, Mili L, Boisen MB, Adapa R (1993) Power system observability with minimal phasor measurement placement. IEEE Trans Power Syst 8(2):707–715

Bhargava B (1999) Synchronized phasor measurement system project at Southern California Edison Co. Power Eng Soc Summer Meet 1999 IEEE 1:16–22

Bodlaender HL (1988) Some classes of graphs with bounded treewidth. Bull EATCS 36:116–126

Brueni DJ (1993) Minimal PMU placement for graph observability, a decomposition approach. MS thesis, Virginia Polytechnic Institute and State University, Blacksburg, VA

Brueni DJ, Heath LS (2005) The PMU placement problem. SIAM J Discrete Math 19(3):744–761

Demaine ED, Hajiaghayi MT (2005) Bidimensionality: new connections between FPT algorithms and PTASs. In: Proceedings of the 16th annual ACM-SIAM symposium on discrete algorithms, pp 590–601

Diestel R (2000) Graph theory, 2nd edn. Springer, New York

Dorfling M, Henning MA (2006) A note on power domination in grid graphs. Discrete Appl Math 154(6):1023–1027

Feige U (1998) A threshold of ln n for approximating set cover. J ACM 45(4):634–652

Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York

Guo J, Niedermeier R, Raible D (2005) Improved algorithms and complexity results for power domination in graphs. In: Proceedings of the 15th international symposium on fundamentals of computation theory. LNCS, vol 3623. Springer, Berlin, pp 172–184 (To appear in Algorithmica)

Haynes TW, Hedetniemi ST, Slater PJ (1998a) Domination in graphs: advanced topics. Marcel Dekker, New York

Haynes TW, Hedetniemi ST, Slater PJ (1998b) Fundamentals of domination in graphs. Marcel Dekker, New York

Haynes TW, Hedetniemi SM, Hedetniemi ST, Henning MA (2002) Domination in graphs applied to electric power networks. SIAM J Discrete Math 15(4):519–529

Johnson DS (1974) Approximation algorithms for combinatorial problems. J Comput Syst Sci 9(3):256–278

Kloks T (1994) Treewidth, computations and approximations. LNCS, vol 842. Springer, Berlin

Kneis J, Mölle D, Richter S, Rossmanith P (2006) Parameterized power domination complexity. Inf Process Lett 98(4):145–149

Kortsarz G (2001) On the hardness of approximating spanners. Algorithmica 30(3):432–450

Liao CS, Lee DT (2005) Power domination problem in graphs. In: Proceedings of the 11th international computing and combinatorics conference. LNCS, vol 3595. Springer, Berlin, pp 818–828

Lund C, Yannakakis M (1994) On the hardness of approximating minimization problems. J ACM 41(5):960–981

Martin KE (2002) Phasor measurements at the Bonneville power administration. Power systems and communications infrastructures for the future

Mili L, Baldwin TL, Phadke AG (1991) 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

Nuqui RF (2001) State estimation and voltage security monitoring using synchronized phasor measurements, PhD thesis, Virginia Polytechnic Institute and State University, July 2001

Phadke AG (2002) Synchronized phasor measurements—a historical overview. Transm Distrib Conf Exhib 1:476–479

Raz R, Safra S (1997) 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 theory of computing, pp 475–484

Zhao M, Kang L, Chang GJ (2006) Power domination in graphs. Discrete Math. 306(15):1812–1816