Abstract
We consider the single channel PMU placement problem called the Power Edge Set problem. In this variant of the PMU placement problem, (single channel) PMUs are placed on the edges of an electrical network. Such a PMU measures the current along the edge on which it is placed and the voltage at its two endpoints. The objective is to find the minimum placement of PMUs in the network that ensures its full observability, namely measurement of all the voltages and currents. We prove that PES is NP-hard to approximate within a factor (1.12)-\(\epsilon \), for any \(\epsilon > 0\). On the positive side we prove that PES problem is solvable in polynomial time for trees and grids.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aazami A (2008) Hardness results and approximation algorithms for some problems on graphs. Ph.D. thesis, Department of Combinatorics and Optimization, University of Waterloo, Ontario, Canada
Aazami A, Stilp M (2007) Approximation algorithms and hardness for domination with propagation. In: Charikar M, Jansen K, Reingold O, Rolim J (eds) Approximation, randomization, and combinatorial optimization: algorithms and techniques, volume 4627 of lecture notes in computer science. Springer, Berlin, pp 1–15
Brueni DJ, Heath LS (2005) The PMU placement problem. SIAM J Discrete Math 19(3):744–761
Dinur I, Safra S (2005) On the hardness of approximating minimum vertex cover. Ann Math 162(1):439–485
Dorfling M, Henning MA (2006) A note on power domination in grid graphs. Discrete Appl Math 154(6):1023–1027
Emami R, Abur A (2010) Robust measurement design by placing synchronized phasor measurements on network branches. IEEE Trans Power Syst 25(1):38–43
Emami R, Abur A, Galvan F (2008) Optimal placement of phasor measurements for enhanced state estimation: a case study. In: 16th Power systems computation conference. IEEE, Piscataway, pp 923–928
Feige U (2003) Vertex cover is hardest to approximate on regular graphs. Technical Report MCS03-15, Weizmann Institute
Guo J, Niedermeier R, Raible D (2005) Improved algorithms and complexity results for power domination in graphs. In: Liśkiewicz M, Reischuk R (eds) Fundamentals of computation theory, volume 3623 of lecture notes in computer science. Springer, Berlin, pp 172–184
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
Khanna S, Motwani R, Sudan M, Vazirani U (1999) On syntactic versus computational views of approximability. SIAM J Comput 28(1):164–191
Manousakis NM, Korre GN, Georgilakis PS (2012) Taxonomy of PMU placement methodologies. IEEE Trans Power Syst 27(2):1070–1077
Minimum Rank-Special Graphs Work Group (2008) Zero forcing sets and the minimum rank of graphs. Linear Algebra Its Appl 428(7):1628–1648
Moran S, Wolfstahl Y (1991) Optimal covering of cacti by vertex-disjoint paths. Theor Comput Sci 84(2):179–197
Poirion PL, Toubaline S, D’Ambrosio C, Liberti L (2016) The power edge set problem. Networks 68(2):104–120
Xu G, Kang L, Shan E, Zhao M (2006) Power domination in block graphs. Theor Comput Sci 359(1–3):299–305
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was carried out as part of the SOGRID Project (www.so-grid.com), co-funded by the French agency for Environment and Energy Management (ADEME) and developed in collaboration between participating academic and industrial partners.
Rights and permissions
About this article
Cite this article
Toubaline, S., D’Ambrosio, C., Liberti, L. et al. Complexity and inapproximability results for the Power Edge Set problem. J Comb Optim 35, 895–905 (2018). https://doi.org/10.1007/s10878-017-0241-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-017-0241-y