New Insights for Power Edge Set Problem

  • Benoit Darties
  • Annie Chateau
  • Rodolphe Giroudeau
  • Mathias Weller
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10627)


We study the computational complexity of Power Edge Set (PES), for restricted graph classes with degree bounded by three (bipartite graph, Unit disk graphs and Grid graphs). This problem is devoted to the monitoring of an electric network. The aim is to minimize the number of edge-allocated PMUs in a network such that all vertices are monitored according to two spreading rules. We improve known complexity results using an L-reduction. We also derive some lowers bounds according to classic complexity hypothesis (\(\mathcal {P} \ne \mathcal {NP}\), \(\mathcal {UGC}\), \(\mathcal {ETH}\)).


  1. 1.
    Austrin, P., Khot, S., Safra, M.: Inapproximability of vertex cover and independent set in bounded degree graphs. In: Proceedings of the Annual IEEE Conference on Computational Complexity, pp. 74–80 (2009)Google Scholar
  2. 2.
    Darties, B., Chateau, A., Giroudeau, R., Weller, M.: Improved complexity for power edge set problem. In: 28th International Workshop on Combinatorial Algorithms (2017)Google Scholar
  3. 3.
    Dorfling, M., Henning, M.: A note on power domination in grid graphs. Discr. Appl. Math. 154(6), 1023–1027 (2006)CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    Feige, U.: Vertex cover is hardest to approximate on regular graphs. Technical report MCS03-15, the Weizmann Institute (2003)Google Scholar
  5. 5.
    Gou, B.: Generalized integer linear programming formulation for optimal PMU placement. IEEE Trans. Power Syst. 23(3), 1099–1104 (2008)CrossRefGoogle Scholar
  6. 6.
    Haynes, T.W., Hedetniemi, S.M., Hedetniemi, S.T., Henning, M.A.: Domination in graphs applied to electric power networks. SIAM J. Discr. Math. 15(4), 519–529 (2002)CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Impagliazzo, R., Paturi, R.: On the complexity of \(k\)-SAT. J. Comput. Syst. Sci. 62(2), 367–375 (2001)CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    Li, Y., Thai, M.T., Wang, F., Yi, C., Wan, P., Du, D.: On greedy construction of connected dominating sets in wireless networks. Wirel. Commun. Mobile Comput. 5(8), 927–932 (2005)CrossRefGoogle Scholar
  9. 9.
    Lokshtanov, D., Marx, D., Saurabh, S.: Lower bounds based on the exponential time hypothesis. Bull. EATCS 105, 41–72 (2011)zbMATHMathSciNetGoogle Scholar
  10. 10.
    Papadimitriou, C., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. Syst. Sci. 43(3), 425–440 (1991)CrossRefzbMATHMathSciNetGoogle Scholar
  11. 11.
    Poirion, P., Toubaline, S., D’Ambrosio, C., Liberti, L.: The power edge set problem. Networks 68(2), 104–120 (2016)CrossRefMathSciNetGoogle Scholar
  12. 12.
    Radwan, A.: A new algorithm for orthogonal drawings of 3-planar graphs. Int. J. Appl. Math. 6(3), 301–317 (2001)zbMATHMathSciNetGoogle Scholar
  13. 13.
    Simonetti, L., Salles da Cunha, A., Lucena, A.: The minimum connected dominating set problem: formulation, valid inequalities and a branch-and-cut algorithm. In: Pahl, J., Reiners, T., Voß, S. (eds.) INOC 2011. LNCS, vol. 6701, pp. 162–169. Springer, Heidelberg (2011). CrossRefGoogle Scholar
  14. 14.
    Thai, M.T., Du, D.Z.: Connected dominating sets in disk graphs with bidirectional links. IEEE Commun. Lett. 10(3), 138–140 (2006)CrossRefGoogle Scholar
  15. 15.
    Toubaline, S., Poirion, P.-L., D’Ambrosio, C., Liberti, L.: Observing the state of a smart grid using bilevel programming. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, D.-Z. (eds.) COCOA 2015. LNCS, vol. 9486, pp. 364–376. Springer, Cham (2015). CrossRefGoogle Scholar
  16. 16.
    Yuill, W., Edwards, A., Chowdhury, S., Chowdhury, S.P.: Optimal PMU placement: a comprehensive literature review. In: 2011 IEEE Power and Energy Society General Meeting, pp. 1–8, July 2011Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Benoit Darties
    • 1
  • Annie Chateau
    • 2
  • Rodolphe Giroudeau
    • 2
  • Mathias Weller
    • 2
  1. 1.Le2i FRE2005, CNRS, Arts et MétiersUniv. Bourgogne Franche-ComtéDijonFrance
  2. 2.LIRMM - CNRS UMR 5506MontpellierFrance

Personalised recommendations