Complexity and inapproximability results for the Power Edge Set problem
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.
KeywordsPMU placement problem Power Edge Set NP-hardness Inapproximability
- 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, CanadaGoogle Scholar
- 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–15Google Scholar
- 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–928Google Scholar
- Feige U (2003) Vertex cover is hardest to approximate on regular graphs. Technical Report MCS03-15, Weizmann InstituteGoogle Scholar
- 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–184Google Scholar